@misc{googleDatabase,
Author={},
url = "https://www.google.com/get/spectrumdatabase/",
//Howpublished={\url{https://www.google.com/get/spectrumdatabase/}},
Title="{Google spectrum database}",
note="Visited Juni 2016"
}

@article{Li2012DistributedTS,
  title={Distributed TV spectrum allocation for cognitive cellular network under game theoretical framework},
  author={Di Li and James Gross},
  journal={2012 IEEE International Symposium on Dynamic Spectrum Access Networks},
  year={2012},
  pages={327-338}
}

@misc{ofcom15, 
title={Implementing TV White Spaces}, 
url={https://www.ofcom.org.uk/__data/assets/pdf_file/0034/68668/tvws-statement.pdf}, 
journal={ofcom}, author={Ofcom}}

@book{ECC186,
title={Technical and operational requirements for the operation of white space devices undergeo-location approach}, 
author ={The Electronic Communications Committee (ECC) } }


@book{ECMA392,
title={MAC and PHY for Operation in TVWS},
series={1 June 2012.}, 
author ={Ecma International}}


@INPROCEEDINGS{ECC236,
author={The Electronic Communications Committee (ECC)},
title={guidance for national implementation of a regulatory framework for tv wsd using geo-location databases},
year={2015},
month={May.},
}
@ARTICLE{Mitsos2009McCormickBasedRO,
  title={McCormick-Based Relaxations of Algorithms},
  author={Alexander Mitsos and Beno{\^i}t Chachuat and Paul I. Barton},
  journal={SIAM Journal on Optimization},
  year={2009},
  volume={20},
  pages={573-601}
}

@INPROCEEDINGS{Mansoor2015,
author="Mansoor, Nafees
and Muzahidul Islam, A. K. M.
and Zareei, Mahdi
and Baharun, Sabariah
and Komaki, Shozo",
title="Construction of a Robust Clustering Algorithm for Cognitive Radio Ad-Hoc Network",
bookTitle="Proc. of CROWNCOM 2015",
}



@INPROCEEDINGS{Jacob2012,
author="Jacob, Jaison
and Jose, Babita R.
and Mathew, Jimson",
title="Cellular Automata Approach for Spectrum Sensing in Energy Efficient Sensor Network Aided Cognitive Radio",
bookTitle=" Proc. of ICECCS 2012",
}



@ARTICLE{gerla_97, 
author={C. R. Lin and M. Gerla}, 
journal={IEEE Journal on Selected Areas in Communications}, 
title={Adaptive clustering for mobile wireless networks}, 
year={1997}, 
volume={15}, 
number={7}, 
pages={1265-1275}, 
keywords={adaptive systems;code division multiple access;data communication;land mobile radio;multimedia communication;network topology;personal communication networks;telecommunication network routing;adaptive clustering;bandwidth reservation;bandwidth sharing;code-division multiple access;dynamic radio network;mobile computing;mobile wireless networks;multihop mobile radio network;multimedia;network architecture;network nodes;node clustering;node failure;node insertion;node motion;node removal;nonoverlapping clusters;personal communications;robust cluster algorithm;routing;self-organizing radio network;simulation;spatial bandwidth reuse;system performance;traffic integration;transport protocol;Bandwidth;Base stations;Computer networks;Mobile communication;Mobile computing;Multimedia systems;Robustness;Spread spectrum communication;Traffic control;Wireless networks}, 
doi={10.1109/49.622910}, 
ISSN={0733-8716}, 
month={Sep},}

@article{2017arXiv170404828L,
   author = {{Li}, D. and {Fang}, E. and {Gross}, J.},
    title = "{Versatile Robust Clustering of Ad Hoc Cognitive Radio Network}",
  journal = {ArXiv e-prints, 1704.04828},
   #eprint = {1704.04828},
 primaryClass = "cs.GT",
 keywords = {Computer Science - Computer Science and Game Theory, Computer Science - Networking and Internet Architecture},
     year = 2017,
    month = apr,
   adsurl = {http://adsabs.harvard.edu/abs/2017arXiv170404828L},
  adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}

@article{Rawat20161,
title = "Cognitive radio for M2M and Internet of Things: A survey",
journal = "Computer Communications",
volume = "94",
number = "",
pages = "1 - 29",
year = "2016",
note = "",
issn = "0140-3664",
author = "Priyanka Rawat and Kamal Deep Singh and Jean Marie Bonnin",
abstract = "Abstract Internet of things (IoT) paradigm poses new challenges to the communication technology as numerous heterogeneous objects will need to be connected. To address these issues new radio technologies and network architectures need to be designed to cater to several future devices having connectivity demands. For radio communications, the frequency spectrum allocation will have to be adapted for efficient spectrum utilization considering new bandwidth and application requirements. Novel research directions based on the use of opportunistic radio resource utilization such as those based on cognitive radio (CR) technology will have to be pursued for efficiency as well as reliability. Cognitive Radio is a promising enabler communication technology for IoT. Its opportunistic communication paradigm is suited to communicating objects having event driven nature, that generate bursty traffic. Cognitive Radio can help overcome the problems of collision and excessive contention in the wireless access network that will arise due to the deployment of several objects connected to infrastructure through radio links. However, there are several issues that need to be addressed before cognitive radio technology can be used for Internet of things. This paper surveys novel approaches and discusses research challenges related to the use of cognitive radio technology for Internet of things. In addition, the paper presents a general background on cognitive radio and Internet of Things with some potential applications. Our survey is different from existing surveys in that we focus on recent advances and ongoing research directions in cognitive radio in the context of Machine to Machine and Internet of Things. We review \{CR\} solutions that address generic problems of IoT including emerging challenges of autonomicity, scalability, energy efficiency, heterogeneity in terms of user equipment capabilities, complexity and environments, etc. The solutions are supported by our taxonomy of different \{CR\} approaches that are classified into two categories, flexible and efficient networking, and tackling heterogeneity. This paper intends to help new researchers entering the domain of \{CR\} and IoT by providing a comprehensive survey on recent advances. "
}



@misc{robust_clustering_arxiv,
     author    = "Di Li and Erwin Fang and James Gross",
     title     = "{Robust Clustering in Cognitive Radio Network with Cluster Size Control}",
     year      = "2017",
     archivePrefix = "arXiv",
     eprint        = "xxxx.xxxx",
     primaryClass  = "hep-th",
}

@INPROCEEDINGS{mansoor_15_cluster_robust,
    author={Nafees Mansoor and A. Islam and Mahdi Zareei and Sabariah Baharun and Shozo Komaki},
    title={Construction of a Robust Clustering Algorithm for Cognitive Radio Ad-Hoc Network},
    booktitle={Proc. of CROWNCOM 2015},
//    year={2015},
//    month={10},
    keywords={Cognitive radio networks Ad-hoc networks Cluster-based network Network architecture Re-clustering},
    doi={10.1007/978-3-319-24540-9_63}
}

@INPROCEEDINGS{Ozger_cluster_crsn_13, 
author={M. Ozger and O. B. Akan}, 
booktitle={Proc. of IEEE INFOCOM 2013}, 
title={Event-driven spectrum-aware clustering in cognitive radio sensor networks}, 
keywords={cognitive radio;energy conservation;pattern clustering;protocols;radio spectrum management;telecommunication power management;wireless channels;wireless sensor networks;CRSN;DSA capability;WSN;cluster channels;cluster-head selection;clustering node determination;cognitive radio sensor networks;dynamic spectrum access capability;energy consumption reduction;energy-efficient solutions;event detection;event-driven clustering protocol;event-driven spectrum-aware clustering;maintenance overheads;one-hop members;one-hop neighbors;performance evaluation;spectrum scarcity problem;spectrum utilization;temporal cluster;two-hop neighbors;unnecessary cluster formation;wireless sensor networks;Availability;Clustering algorithms;Cognitive radio;Energy consumption;Protocols;Wireless sensor networks}, 
doi={10.1109/INFCOM.2013.6566943}, 
ISSN={0743-166X}, 
//month={April},
}

@INPROCEEDINGS{Efficient_broadcasting_gathering_adhoc,
author={M. Onus and A. Richa and K. Kothapalli and C. Scheideler},
booktitle={Proc. of ISPAN 2005},
title={Efficient broadcasting and gathering in wireless ad-hoc networks},
keywords={ad hoc networks;mobile radio;radio broadcasting;radiofrequency interference;information gathering;interference range;message broadcasting;mobile host;wireless ad-hoc network;wireless communication;Ad hoc networks;Algorithm design and analysis;Broadcasting;Computer science;Intelligent networks;Interference;Packet radio networks;Wireless communication;Wireless networks;Wireless sensor networks},
doi={10.1109/ISPAN.2005.43},
ISSN={1087-4089},
//month={Dec},

}


@article{unitDiskModel,
title = "Unit Disk Graphs",
author = "Clark, {Brent N.} and Colbourn, {Charles J.} and Johnson, {David S.}",
year = "1991",
doi = "10.1016/S0167-5060(08)71047-1",
volume = "48",
pages = "165--177",
journal = "Annals of Discrete Mathematics",
issn = "0167-5060",
number = "C",

}


@inproceedings{Kim_resource_allocation_80222,
 author = {Kim, Hyoil and Shin, Kang G.},
 title = {Asymmetry-aware Real-time Distributed Joint Resource Allocation in IEEE 802.22 WRANs},
 booktitle = {Proceedings of the 29th Conference on Information Communications},
 series = {INFOCOM'10},
 year = {2010},
 isbn = {978-1-4244-5836-3},
 location = {San Diego, California, USA},
 pages = {543--551},
 numpages = {9},
 url = {http://dl.acm.org/citation.cfm?id=1833515.1833622},
 acmid = {1833622},
 publisher = {IEEE Press},
 address = {Piscataway, NJ, USA},
} 


@inproceedings {BCJ10, 
	title = {Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad Hoc Networks},
	author = {Emmanuel Baccelli and Juan Antonio Cordero and Philippe Jacquet},
	year = {2010},
	booktitle = {In 7th IEEE International Conference Mobile Ad-hoc and Sensor Systems (MASS)},
}

@ARTICLE{capacity_cluster_06,
author={E. Perevalov and R. S. Blum and D. Safi},
journal={IEEE Transactions on Communications},
title={Capacity of clustered ad hoc networks: how large is "Large"?},
year={2006},
volume={54},
number={9},
pages={1672-1681},
keywords={ad hoc networks;cluster density;cluster size;clustered wireless ad hoc networks;low-density nodes;network size;Ad hoc networks;Base stations;Cellular phones;Degradation;Mobile ad hoc networks;Scattering;Spine;Switches;Throughput;Wireless networks;Ad hoc networks;capacity;clusters;throughput;wireless networks},
doi={10.1109/TCOMM.2006.878836},
ISSN={0090-6778},
month={Sept},}



@INPROCEEDINGS{Chen04clusteringalgorithms,
    author = {Yuanzhu Peter Chen and Arthur L. Liestman and Jiangchuan Liu},
    title = {Clustering Algorithms for Ad Hoc Wireless Networks},
    booktitle = {Ad Hoc and Sensor Networks. Nova Science Publishers},
    year = {2004}
}


@ARTICLE{sensing_survey_2009,
author={T. Yucek and H. Arslan},
journal={IEEE Communications Surveys Tutorials},
title={A survey of spectrum sensing algorithms for cognitive radio applications},
year={2009},
volume={11},
number={1},
pages={116-130},
keywords={cognitive radio;radio access networks;sensors;spread spectrum communication;telecommunication traffic;cognitive radio applications;multidimensional spectrum sensing concept;network traffic;network utilization;opportunistic spectrum access concepts;primary user behavior;statistical modeling;Cognitive radio;Energy measurement;FCC;Frequency measurement;Predictive models;Radio spectrum management;Radiofrequency identification;Telecommunication traffic;Traffic control;Wireless sensor networks;Cognitive radio, spectrum sensing, dynamic spectrum access, multi-dimensional spectrum sensing, cooperative sensing, radio identification},
doi={10.1109/SURV.2009.090109},
ISSN={1553-877X},
month={First},}


@inproceedings{Papadimitriou:2001:AGI,
 author = {Papadimitriou, Christos},
 title = {Algorithms, Games, and the Internet},
 booktitle = {Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing},
 series = {STOC '01},
 year = {2001},
 isbn = {1-58113-349-9},
 location = {Hersonissos, Greece},
 pages = {749--753},
 numpages = {5},
 url = {http://doi.acm.org/10.1145/380752.380883},
 doi = {10.1145/380752.380883},
 acmid = {380883},
 publisher = {ACM},
 address = {New York, NY, USA},
} 
@article{complexity_aggregation_2011,
author = {Xiang-Yang Li and Yajun Wang and Yu Wang},
title = {Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks},
journal ={IEEE Transactions on Computers},
volume = {60},
number = {3},
issn = {0018-9340},
year = {2011},
pages = {386-399},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.50},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}


@INPROCEEDINGS{he_2012,
author={Qian He and Ping Zhang},
booktitle={In Proceedings of 2012 IEEE Vehicular Technology Conference (VTC Fall)},
title={Dynamic Channel Assignment Using Ant Colony Optimization for Cognitive Radio Networks},
year={2012},
pages={1-5},
keywords={ant colony optimisation;channel allocation;cognitive radio;nonlinear programming;radio networks;radio spectrum management;resource allocation;ACO algorithm;CRN;ant colony optimization;cognitive radio networks;complex multiobjective optimization problem;dynamic channel assignment scheme;heterogeneous network convergence;idle licensed spectrum;intelligent technique;nonlinear programming;optimal resource allocation mechanism;Cognitive radio;Heuristic algorithms;Interference;Optimization;Resource management;Signal to noise ratio},
doi={10.1109/VTCFall.2012.6398951},
ISSN={1090-3038},
month={Sept},}



@INPROCEEDINGS{Chen_2010,
author={Si Chen and Newman, T.R. and Evans, J.B. and Wyglinski, Alexander M.},
booktitle={In Proceedings of 2010 IEEE Sarnoff Symposium},
title={Genetic algorithm-based optimization for cognitive radio networks},
year={2010},
pages={1-6},
keywords={cognitive radio;genetic algorithms;radio networks;search engines;MOGA;cognitive radio networks;genetic algorithm-based optimization;genetic algorithm-based search engine;multiobjective genetic algorithm;population adaptation;variable adaptation;variable quantization;Cognitive radio;Equalizers;Fluctuations;Genetics;Interference;OFDM modulation;Phase modulation;Power amplifiers;Quadrature phase shift keying;Signal design},
doi={10.1109/SARNOF.2010.5469780},
month={April},}


@article{Tang20122690,
title = "Nonconvex dynamic spectrum allocation for cognitive radio networks via particle swarm optimization and simulated annealing ",
journal = "Computer Networks ",
volume = "56",
number = "11",
pages = "2690 - 2699",
year = "2012",
note = "",
issn = "1389-1286",
doi = "http://dx.doi.org/10.1016/j.comnet.2012.04.012",
url = "http://www.sciencedirect.com/science/article/pii/S1389128612001521",
author = "Meiqin Tang and Chengnian Long and Xinping Guan and Xinjiang Wei",
keywords = "Cognitive radio",
keywords = "Nonconvex optimization",
keywords = "Dynamic spectrum allocation",
keywords = "PSO",
keywords = "SA ",
abstract = "Dynamic spectrum access is a promising technique designed to meet the challenge of rapidly growing demands for broadband access in cognitive radio networks. By utilizing the allocated spectrum, cognitive radio devices can provide high throughput and low latency communications. This paper introduces an efficient dynamic spectrum allocation algorithm in cognitive radio networks based on the network utility maximization framework. The objective function in this optimization problem is always nonconvex, which makes the problem difficult to solve. Prior works on network resource optimization always transformed the nonconvex optimization problem into a convex one under some strict assumptions, which do not meet the actual networks. We solve the nonconvex optimization problem directly using an improved particle swarm optimization (PSO) method. Simulated annealing (SA), combined with \{PSO\} to form the \{PSOSA\} algorithm, overcomes the inherent defects and disadvantages of these two individual components. Simulations show that the proposed solution achieves significant throughput compared with existing approaches, and it is efficient in solving the nonconvex optimization problem. "
}



@INPROCEEDINGS{simulated_annealing_09,
author={Meshkova, E. and Riihijarvi, J. and Achtzehn, A. and Mahonen, P.},
booktitle={In Proceedings of 2009 IEEE Global Telecommunications Conference},
title={Exploring Simulated Annealing and Graphical Models for Optimization in Cognitive Wireless Networks},
year={2009},
pages={1-8},
keywords={cognitive radio;learning (artificial intelligence);protocols;simulated annealing;telecommunication computing;application-specific network utilities;black box approach;cognitive wireless networks;graphical models;machine learning techniques;network stack parameters;optimization algorithms;protocols;simulated annealing;Algorithm design and analysis;Convergence;Design optimization;Graphical models;Machine learning;Machine learning algorithms;Protocols;Simulated annealing;Testing;Wireless networks},
doi={10.1109/GLOCOM.2009.5425349},
ISSN={1930-529X},
month={Nov},}

@book{Molisch:2011:WC:1984860,
 author = {Molisch, Andreas F.},
 title = {Wireless Communications},
 year = {2011},
 isbn = {0470741864, 9780470741863},
 edition = {2nd},
 publisher = {Wiley Publishing},
} 

@Article{Mansoor2014,
author="Mansoor, Nafees
and Muzahidul Islam, A. K. M.
and Zareei, Mahdi
and Baharun, Sabariah
and Wakabayashi, Toshio
and Komaki, Shozo",
title="Cognitive Radio Ad-Hoc Network Architectures: A Survey",
journal="Wireless Personal Communications",
year="2014",
volume="81",
number="3",
pages="1117--1142",
abstract="Combating the growing necessity of radio spectrum, which is a limited natural resource, proper utilization of the radio spectrum is a must. Cognitive radio network (CRN) plays a vibrant role to solve this spectrum scarcity problem. Cognitive radio uses an open spectrum allocation technique to make more efficient utilization of the wireless radio spectrum and reduces the bottleneck on the frequency bands. Thus, accessible spectrum information is required for communication in CRN, which can be acquired by using spectrum database or by spectrum sensing. In addition, a robust architecture with appropriate communication protocol is preconditioned in the deployment of CRN. The state of the art of cognitive radio ad-hoc network architecture is surveyed in this paper, where the paper specifies the formation mechanisms and performance evaluations of the studied architectures. The reviewed papers have addressed some vital issues for the concrete deployment of cognitive radio ad-hoc network; however, there remain some issues that need to be addressed. Thus, this paper conveys a thorough and abstract understanding of cognitive radio ad-hoc network architecture, and also points out some open research issues in this area.",
issn="1572-834X",
doi="10.1007/s11277-014-2175-3",
url="http://dx.doi.org/10.1007/s11277-014-2175-3"
}

@INPROCEEDINGS{centralized_dis_opt_crn_09globalcom,
author={Yao Ma and Dong In Kim},
booktitle={Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE},
title={Centralized and Distributed Optimization of Ad-Hoc Cognitive Radio Network},
year={2009},
pages={1-7},
keywords={ad hoc networks;cognitive radio;optimisation;C-rate modulations;CRN local information exchange;CRN optimization;D-rate modulations;Lagrange duality optimization tool;PRN cells;PRN subband;PSM;SINR outage probability;SU links;WSR maximization schemes;ad hoc secondary user;ad-hoc cognitive radio network;continuous rate modulation;discrete rate modulation;distributed access duality scheme;distributed optimization;fast-convergent weighted sum rate;maximum-subchannel-rate;multicell primary radio networks;optimal duality scheme;power spectral mask;signal-to-interference-plus-noise ratio;system operating parameters;Cognitive radio;Constraint optimization;Design optimization;Frequency;Lagrangian functions;Meteorological radar;Quality of service;Radio network;Signal to noise ratio;Throughput},
doi={10.1109/GLOCOM.2009.5425837},
ISSN={1930-529X},
month={Nov},}


@article{boyd2007notes,
  title={Notes on decomposition methods},
  author={Boyd, Stephen and Xiao, Lin and Mutapcic, Almir and Mattingley, Jacob},
  journal={Notes for EE364B, Stanford University},
  year={2007}
}



@book{Bertsekas_99,
  added-at = {2008-10-07T16:03:39.000+0200},
  author = {Bertsekas, D.P.},
  biburl = {http://www.bibsonomy.org/bibtex/2e0a5e65ff1109bdeaa6cfc2a2481e28a/brefeld},
  interhash = {707445f7e287b760fbc42a68a902abca},
  intrahash = {e0a5e65ff1109bdeaa6cfc2a2481e28a},
  keywords = {imported},
  publisher = {Athena Scientific},
  timestamp = {2008-10-07T16:03:40.000+0200},
  title = {Nonlinear Programming},
  year = 1999
}



@ARTICLE{Palomar06atutorial,
    author = {Daniel P. Palomar and Mung Chiang},
    title = {A Tutorial on Decomposition Methods for Network Utility Maximization},
    journal = {IEEE J. Sel. Areas Commun},
    year = {2006},
    volume = {24},
    pages = {1439--1451}
}

@book{Boyd:2004:CO:993483,
 author = {Boyd, Stephen and Vandenberghe, Lieven},
 title = {Convex Optimization},
 year = {2004},
 isbn = {0521833787},
 publisher = {Cambridge University Press},
 address = {New York, NY, USA},
} 

@ARTICLE{tachwali_opt_bandwidth_power_2013,
author={Tachwali, Y. and Lo, B.F. and Akyildiz, I.F. and Agusti, R.},
journal={Selected Areas in Communications, IEEE Journal on},
title={Multiuser Resource Allocation Optimization Using Bandwidth-Power Product in Cognitive Radio Networks},
year={2013},
volume={31},
number={3},
pages={451-463},
keywords={OFDM modulation;cellular radio;cognitive radio;frequency division multiple access;iterative methods;multiuser channels;optimisation;radio networks;resource allocation;OFDMA;bandwidth-power product;bandwidth-power product minimization;classical power adaptive optimization;cognitive radio networks;iterative waterfilling scheme;joint bandwidth;multiuser resource allocation optimization;orthogonal frequency division multiple access;power allocation;primary user communication;single-cell multiuser cognitive radio network;spectral resource consumption;Bandwidth;Channel allocation;Interference;Measurement;Optimization;Resource management;Wireless communication;Bandwidth-Power Product;Cognitive Radio;Downlink;OFDMA;Optimization;Resource Allocation},
doi={10.1109/JSAC.2013.130311},
ISSN={0733-8716},
month={March},}



@ARTICLE{altman_Smodel_pc_2003,
author={Altman, E. and Altman, Z.},
journal={IEEE Transactions on Automatic Control},
title={S-modular games and power control in wireless networks},
year={2003},
volume={48},
number={5},
pages={839-842},
keywords={convergence of numerical methods;distributed control;game theory;mobile radio;power control;telecommunication control;S-modular games;asynchronous algorithms;centralized power control algorithms;convergence properties;distributed power control algorithms;policy sets;signal-to-interference ratio constraints;synchronous algorithms;wireless communications;wireless networks;Convergence;Distributed decision making;Game theory;Intelligent networks;Noise level;Power control;Signal analysis;Wireless communication;Wireless networks;Working environment noise},
doi={10.1109/TAC.2003.811264},
ISSN={0018-9286},
month={May},}



@article{Lazos09,
author={Lazos, L. and Sisi Liu and Krunz, M.},
comment={journal={Sensor, Mesh and Ad Hoc Communications and Networks, 2009. SECON '09. 6th Annual IEEE Communications Society Conference on}, },
journal={Proc. of SECON '09},
title={Spectrum Opportunity-Based Control Channel Assignment in Cognitive Radio Networks},
year={2009},
month={jun.},
volume={},
number={},
pages={1 -9},
keywords={cognitive radio network;distributed cluster agreement algorithm;dynamic control channel assignment;maximum edge biclique problem;primary radio;space-varying spectrum opportunity clustering;time-varying spectrum opportunity;channel allocation;cognitive radio;distributed algorithms;graph theory;spectral analysis;telecommunication control;wireless channels;},
doi={10.1109/SAHCN.2009.5168974},
ISSN={},}

@article{Zhao07,
 author = {Zhao, Jun and Zheng, Haitao and Yang, Guang-Hua},
 title = {Spectrum sharing through distributed coordination in dynamic spectrum access networks},
 journal = {Wireless Com. and Mobile Computing},
 volume = {7},
 number = {9},
 year = {2007},
 issn = {1530-8669},
 doi = {http://dx.doi.org/10.1002/wcm.v7:9},
 publisher = {John Wiley and Sons Ltd.},
 address = {Chi	chester, UK},
 }

@article{Akyildiz09,
 author = {Akyildiz, Ian F. and Lee, Won-Yeol and Chowdhury, Kaushik R.},
 title = {{CRAHNs}: Cognitive radio ad hoc networks},
 journal = {Ad Hoc Netw.},
 volume = {Vol. 7},
 number = {5},
 year = {2009},
 issn = {1570-8705},
 pages = {810--836},
 doi = {http://dx.doi.org/10.1016/j.adhoc.2009.01.001},
 publisher = {Elsevier Science Publishers B. V.},
 address = {Amsterdam, The Netherlands, The Netherlands},
 }

@article{Chen07,
author={Tao Chen and Honggang Zhang and Maggio, G.M. and Chlamtac, I.},
comment={journal={New Frontiers in Dynamic Spectrum Access Networks, 2007. DySpan 2007. 2nd IEEE International Symposium on}, },
journal={Proc. of DySPAN '07}, 
title={CogMesh: A Cluster-Based Cognitive Radio Network},
%year={2007},
%month={apr.},
volume={},
number={},
%pages={168 -178},
keywords={CogMesh;cognitive radio network;control allocation scheme;radio spectrum;spectrum management;wireless ad-hoc networks;ad hoc networks;cognitive radio;radio spectrum management;},
doi={10.1109/DYSPAN.2007.29},
ISSN={},}


@inproceedings{Sun07_clustering_spectrum_secsing,
  author    = {Chunhua Sun and
               Wei Zhang and
               Khaled Ben Letaief},
  title     = {Cluster-Based Cooperative Spectrum Sensing in Cognitive
               Radio Systems},
  booktitle = {proc. of IEEE ICC 2007},
  ee        = {http://dx.doi.org/10.1109/ICC.2007.415},
  bibsource = {DBLP, http://dblp.uni-trier.de},
}

@article{Zhang09,
author={Qian Zhang and Juncheng Jia and Jin Zhang},
journal={Communications Magazine, IEEE}, title={Cooperative relay to improve diversity in cognitive radio networks},
year={2009},
month={feb.},
volume={47},
number={2},
pages={111 -117},
keywords={MAC protocol;cognitive radio networks;cooperative relay;cooperative transmission;dynamic spectrum access;software radio;spatial diversity;spectrum holes;spectrum utilization;transmission diversity gain;access protocols;cognitive radio;diversity reception;radio spectrum management;software radio;},
doi={10.1109/MCOM.2009.4785388},
ISSN={0163-6804},}

@INPROCEEDINGS{Kawadia03,
    author = {Vikas Kawadia and P. R. Kumar},
    title = {Power Control and Clustering in Ad Hoc Networks},
    booktitle = {Proc. of INFOCOM '03},
    year = {2003},
    pages = {459--469}
}

@article{Chatterjee01wca,
    author = {Mainak Chatterjee and Sajal K. Das and Damla Turgut},
    title = {WCA: A Weighted Clustering Algorithm for Mobile Ad hoc Networks},
    journal = {Journal of Cluster Computing (Special Issue on Mobile Ad hoc Networks},
    year = {2001},
    volume = {5},
    pages = {193--204}
}


@INPROCEEDINGS{Amis00max-mind-cluster,
    author = {Alan D. Amis and Ravi Prakash and Thai H.P. Vuong and Dung T. Huynh and Thai H. P and Vuong Dung and T. Huynh},
    title = {Max-Min D-Cluster Formation in Wireless Ad Hoc Networks},
    booktitle = {Proceedings of IEEE INFOCOM},
    year = {2000},
    pages = {32--41}
}

@article{Lin97adaptiveclustering,
    author = {Chunhung Richard Lin and Mario Gerla},
    title = {Adaptive clustering for mobile wireless networks},
    journal = {IEEE Journal on Selected Areas in Communications},
    year = {1997},
    volume = {15},
    pages = {1265--1275}
}

@article{Basagni99,
author={Basagni, S.},
comment={journal={Parallel Architectures, Algorithms, and Networks, 1999. (I-SPAN '99) Proceedings. Fourth InternationalSymposium on}, },
journal={Proc. of I-SPAN '99},
title={Distributed clustering for ad hoc networks},
year={1999},
month={},
volume={},
number={},
pages={310 -315},
keywords={ad hoc networks;distributed clustering;fully mobile network;hierarchical organization;mobile environment;network parameter;time complexity;computational complexity;parallel algorithms;},
doi={10.1109/ISPAN.1999.778957},
ISSN={},}


@article{Ackermann06purenash,
title = "Pure {N}ash equilibria in player-specific and weighted congestion games",
journal = "Theoretical Computer Science",
volume = "Vol. 410",
number = "17",
pages = "1552 - 1563",
year = "2009",
//note = "Internet and Network Economics",
issn = "0304-3975",
doi = "DOI: 10.1016/j.tcs.2008.12.035",
//url = "http://www.sciencedirect.com/science/article/B6V1G-4V7MSV1-4/2/a19600af730757a68dadc3a55028d4fd",
author = "Heiner Ackermann and Heiko Röglin and Berthold Vöcking",
keywords = "Congestion games",
keywords = "Nash equilibria",
keywords = "Matroids"
}

@article{Milchtaich1996111,
title = "Congestion Games with Player-Specific Payoff Functions",
journal = "Games and Economic Behavior",
volume = "13",
number = "1",
pages = "111 - 124",
year = "1996",
note = "",
issn = "0899-8256",
doi = "DOI: 10.1006/game.1996.0027",
url = "http://www.sciencedirect.com/science/article/B6WFW-45MH09M-2Y/2/ad6966b4c9b49d9450d3f995ef526373",
author = "Igal Milchtaich"
}

@ARTICLE{Mitola, 
author={J. Mitola and G. Q. Maguire}, 
journal={IEEE Personal Communications}, 
title={Cognitive radio: making software radios more personal}, 
year={1999}, 
volume={6}, 
number={4}, 
pages={13-18}, 
keywords={cellular radio;cognitive systems;equalisers;knowledge representation languages;model-based reasoning;personal communication networks;protocols;software agents;software architecture;telecommunication computing;GSM;RF bands;air interfaces;automated reasoning;cognitive radio agents;multiband multimode personal communications systems;personal services;protocol stack;radio equalizer;radio etiquette;radio knowledge representation language;radio networks;radio nodes;radio propagation;radio spectrum;radio-domain model-based reasoning;radio-domain-aware intelligent agents;software modules;software radios;spatial patterns;temporal patterns;Application specific integrated circuits;Baseband;Cognitive radio;Equalizers;GSM;Hardware;Modems;Radio frequency;Software algorithms;Software radio},
doi={10.1109/98.788210}, 
ISSN={1070-9916}, 
month={Aug},}

@article{Abbasi_survey_07,
 author = {Abbasi, Ameer Ahmed and Younis, Mohamed},
 title = {A survey on clustering algorithms for wireless sensor networks},
 journal = {Comput. Commun.},
 volume = {30},
 number = {14-15},
 year = {2007},
 issn = {0140-3664},
 pages = {2826--2841},
 doi = {http://dx.doi.org/10.1016/j.comcom.2007.05.024},
 publisher = {Butterworth-Heinemann},
 address = {Newton, MA, USA},
 }

@article {Rosenthal,
   author = {Robert Rosenthal},
   affiliation = {Department of Industrial Engineering and Management Sciences Northwestern University Evanston 60201 Illinois},
   title = {A class of games possessing pure-strategy {N}ash equilibria},
   journal = {International Journal of Game Theory},
   publisher = {Physica Verlag, An Imprint of Springer-Verlag GmbH},
   issn = {0020-7276},
   keyword = {Business and Economics},
   pages = {65-67},
   volume = {2},
   issue = {1},
   #url = {http://dx.doi.org/10.1007/BF01737559},
   notes = {10.1007/BF01737559},
   year = {1973}
}

@article{ADHOC10,
title = "Routing in cognitive radio networks: Challenges and solutions",
journal = "Ad Hoc Networks",
volume = "In Press, Corrected Proof",
number = "",
pages = " - ",
year = "2010",
note = "",
issn = "1570-8705",
doi = "DOI: 10.1016/j.adhoc.2010.06.009",
url = "http://www.sciencedirect.com/science/article/B7576-50G6W7W-2/2/d5b461fdc68da442089f14324c0d948d",
author = "Matteo Cesana and Francesca Cuomo and Eylem Ekici",
keywords = "Cognitive radio networks",
keywords = "Routing protocols",
keywords = "Routing metrics",
keywords = "Cross-layering"
comments_DI ="a survey of routing in CRN."

}

@INPROCEEDINGS{segment-crowncom08,
    author = {Ashwin Sampath and Lei Yang and Lili Cao and Haitao Zheng and Ben Y. Zhao},
    title = {High Throughput Spectrum-aware Routing for Cognitive Radio Networks},
    booktitle = {Proc. of IEEE CrownCom},
    year      = {2008},
    commets = {AOMDV, choose the best route, then channel assignment! throughtput is the goal!
    1.talks about routing discovery, route seclecton, and maagement, but not mechanism for route maintenance.
    2. chckes the overhead with time consumption, not the amount of control msgs.
    3. based on AODV, compared with AODV, two changes,1) the id of rreq msg has no time id (for buliding multi routes), 2) node has info about available information
    }
}

@INPROCEEDINGS{Abbagnale_Gymkhana10,
author={Abbagnale, A. and Cuomo, F.},
booktitle={Proc. of IEEE INFOCOM on Computer Communications Workshops, 2010}, 
title={Gymkhana: A Connectivity-Based Routing Scheme for Cognitive Radio Ad Hoc Networks},
year={2010},
month={march},	
volume={},
number={},
pages={1 -5},
keywords={Gymkhana;Laplacian matrices;Laplacian spectrum of graphs;cognitive radio ad hoc networks;connectivity-based routing scheme;distributed protocol;network connectivity;network topology;path connectivity;routing paths;routing protocols;ad hoc networks;cognitive radio;graph theory;matrix algebra;routing protocols;telecommunication network topology;},
doi={10.1109/INFCOMW.2010.5466618},
ISSN={},}

@INPROCEEDINGS{Khalife08GLOBECOM,
author={Khalife, H. and Ahuja, S. and Malouch, N. and Krunz, M.},
booktitle={Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE}, title={Probabilistic Path Selection in Opportunistic Cognitive Radio Networks},
year={2008},
month={30 2008-dec. 4},
volume={},
number={},
pages={1 -5},
keywords={CR-to-CR link;channel capacity;most probable path;opportunistic cognitive radio networks;primary radio;probabilistic path selection;protocol;routing design;channel capacity;cognitive radio;multipath channels;probability;routing protocols;},
doi={10.1109/GLOCOM.2008.ECP.931},
ISSN={1930-529X},}

@INPROCEEDINGS{Ko_DistributedCA,
author={{Bong-Jun} Ko and Misra, V. and Padhye, J. and Rubenstein, D.},
booktitle={Proc. of IEEE WCNC 2007}, 
title={Distributed Channel Assignment in Multi-Radio 802.11 Mesh Networks},
year={2007},
month={Mar.},
volume={},
number={},
keywords={802.11 network;channel selection decision;data forwarding mechanism;distributed channel assignment;distributed self-stabilizing mechanism;improved network capacity;multiradio mesh networks;multiradio routing;wireless mesh networks;channel allocation;distributed algorithms;wireless LAN;},
doi={10.1109/WCNC.2007.727},
ISSN={1525-3511},}

@inproceedings{Ahmed_CAsurvey,
 author = {Ahmed, M. Ejaz and Qadir, Junaid and Baig, Adeel},
 title = {Channel assignment in cognitive radio networks: comparison and analysis},
 booktitle = {Proceedings of the 6th International Conference on Frontiers of Information Technology},
 series = {FIT '09},
 year = {2009},
 isbn = {978-1-60558-642-7},
 location = {Abbottabad, Pakistan},
 pages = {12:1--12:8},
 articleno = {12},
 numpages = {8},
 url = {http://doi.acm.org/10.1145/1838002.1838015},
 doi = {http://doi.acm.org/10.1145/1838002.1838015},
 acmid = {1838015},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {cognitive radio networks, multichannel assignment, wireless networks},
} 

@INPROCEEDINGS{Babadi_distributedCA,
author={Babadi, B. and Tarokh, V.},
booktitle={Sarnoff Symposium, 2008 IEEE}, title={Distributed Dynamic Frequency Allocation In Wireless Networks Under Time-Varying User Activities},
year={2008},
month=april,
volume={},
number={},
pages={1 -5},
keywords={distributed dynamic frequency allocation;stochastic analysis;stochastic modeling;time-varying user activities;transmission frequency band;two-state Markov model;wireless networks;Markov processes;frequency allocation;wireless channels;},
doi={10.1109/SARNOF.2008.4520043},
ISSN={},}

@INPROCEEDINGS{allerton08_liu,
author={Mingyan Liu and Yunnan Wu},
booktitle={Proc. of Allerton Conference 2008}, 
title={Spectum sharing as congestion games},
year={2008},
month={Sep.},
volume={},
number={},
//pages={1146 -1153},\n
keywords={Nash equilibrium;base stations-access points;congestion game theory;designing protocols;frequency reuse;frequency-space blocks;model pair-wise interference;multiuser frequency adaptation;signaling assumptions;spectrum sharing;wireless channels;wireless networking;game theory;protocols;radio networks;wireless channels;},
doi={10.1109/ALLERTON.2008.4797689},
ISSN={},}

@ARTICLE{Chen_PowerControl,
author={Yan Chen and Guanding Yu and Zhaoyang Zhang and Hsiaohwa Chen and Peiliang Qiu},
journal={IEEE Transactions on Wireless Communications,}, 
title={On cognitive radio networks with opportunistic power control strategies in fading channels},
year={2008},
month={Jul.},
volume={7},
number={7},
pages={2752-2761},
keywords={cognitive radio networks;cognitive user;fading channels;opportunistic power control strategies;system synchronization requirements;cognitive radio;fading channels;power control;protocols;telecommunication control;},
doi={10.1109/TWC.2008.070145},
ISSN={1536-1276},}

@ARTICLE{Ren_PowerControl,
author={Wei Ren and Qing Zhao and Swami, A.},
journal={Selected Areas in Communications, IEEE Journal on}, title={Power control in cognitive radio networks: how to cross a multi-lane highway},
year={2009},
month=september ,
volume={27},
number={7},
pages={1283 -1296},
keywords={CTS;MAC layer throughput;Poisson model;RTS;cognitive radio network;handshake signaling;interference constraint;multilane highway;opportunity detection reliability;physical layer spectrum sensing;power control;spectrum opportunity probability;cognitive radio;power control;probability;radio spectrum management;radiofrequency interference;stochastic processes;telecommunication control;},
doi={10.1109/JSAC.2009.090923},
ISSN={0733-8716},}

@INPROCEEDINGS{Ieong05_singleton,
    author = {Samuel Ieong and Robert Mcgrew and Eugene Nudelman and Yoav Shoham and Qixiang Sun},
    title = {Fast and Compact: A Simple Class of Congestion Games},
    booktitle = {Proc. of the 20th Nat. Conference on Artificial Intelligence (AAAI},
    year = {2005},
    pages = {489--494}
}


@book{schrijver_matroid,
  author = {A. Schrijver},
  interhash = {dfbeb3a87380195540f44a10e9995230},
  intrahash = {496d0012f9b295acbef270a129061375},
  publisher = {Springer},
  title = {Combinatorial Optimization - Polyhedra and Efficiency},
  year = 2003,
  keywords = {imported},
  added-at = {2007-07-05T16:17:35.000+0200},
  description = {bandit problems},
  biburl = {http://www.bibsonomy.org/bibtex/2496d0012f9b295acbef270a129061375/jleny}
}

@INPROCEEDINGS{Voecking06congestiongames,
    author = {Berthold Vöcking},
    title = {Congestion games: Optimization in competition},
    booktitle = {Proc. of second ACiD Workshop},
    year = {2006},
    month={Sep.},
  address = {Durham, UK},    
//    pages = {9-20},\n
//   p_publisher = {Kings College Publications}\n
}


@INPROCEEDINGS{Makram_clustering_dynamic,
author={Makram, S.A. and Gunes, M. and Kchiche, A. and Krebs, M.},
booktitle={Networking, 2008. ICN 2008. Seventh International Conference on}, title={Dynamic Channel Assignment for Wireless Mesh Networks Using Clustering},
year={2008},
month=april,
volume={},
number={},
pages={539 -544},
keywords={cluster channel assignment;local dynamic switching;wireless mesh network;channel allocation;radio networks;},
doi={10.1109/ICN.2008.96},
ISSN={},
comments={Groups are formed beforehand. Assign channels to groups centralized, then CCA, generally, assigning least used channels(based on the times being used or qulility) to interface cards. Three papers of the author come from this idea.},
}

@InProceedings {Parissidis,
   author = {Parissidis, Georgios and Lenders, Vincent and May, Martin and Plattner, Bernhard},
   affiliation = {Swiss Federal Institute of Technology, Communications Systems Group, Gloriastrasse 35, 8092 Zurich Switzerland Switzerland},
   title = {Multi-path Routing Protocols in Wireless Mobile Ad Hoc Networks: A Quantitative Comparison},
   booktitle = {Next Generation Teletraffic and Wired, Wireless Advanced Networking},
   series = {Lecture Notes in Computer Science},
   editor = {Koucheryavy, Yevgeni and Harju, Jarmo and Iversen, Villy},
   publisher = {Springer Berlin, Heidelberg},
   isbn = {},
   pages = {313-326},
   volume = {4003},
   url = {http://dx.doi.org/10.1007/11759355_30},
   note = {10.1007/11759355_30},
   year = {2006}
}

@INPROCEEDINGS{Hou_CA,
author={Hou, Fen and Huang, Jianwei},
booktitle={GLOBECOM 2010, 2010 IEEE Global Telecommunications Conference}, title={Dynamic Channel Selection in Cognitive Radio Network with Channel Heterogeneity},
year={2010},
month=dec.,
volume={},
number={},
pages={1 -6},
keywords={},
doi={10.1109/GLOCOM.2010.5683964},
ISSN={1930-529X},
comments={System model is very paricular--secondary users are divided into sources and destinations. It seems each pair of S-D is one -hop away, or every pair can communicate directly, which is not realistic; The _authors want to minimize collisions among SUs thus use a CSMA-CA like mechanism to assign right to each SU to access the idle spectrum. This method should be very conservative; The goal of the scheme is to improve the channel utilization function, numberic results are give to show the performance of both centralized and distributed schemes, but no other scheme is illustrated, and no other metrics such as throughput, interference and so on}
}

@ARTICLE{commag-Khalife08,
author={Khalife, H. and Malouch, N. and Fdida, S.},
journal={Network, IEEE}, title={Multihop cognitive radio networks: to route or not to route},
year={2009},
month={july-august},
volume={23},
number={4},
pages={20 -25},
keywords={adaptive wireless networks;multihop cognitive radio networks;routing;cognitive radio;radio networks;telecommunication network routing;},
doi={10.1109/MNET.2009.5191142},
comments={good analysis!},
ISSN={0890-8044},}

@INPROCEEDINGS{ondemand_Cheng07,
author={Geng Cheng and Wei Liu and Yunzhao Li and Wenqing Cheng},
booktitle={Communications, 2007. ICC '07. IEEE International Conference on}, 
title={Joint On-Demand Routing and Spectrum Assignment in Cognitive Radio Networks},
year={2007},
month=june,
volume={},
number={},
notes={
proposes Delay motivated On-demand Routing Protocol.
2. delay is caused by switching, queueing and backoff. switching is due to heterogeneous spactrum, queueing and backoff are resulted interferences.
3. based on AODV, RREQ messages piggyback SOP which is static. Common control channel is used.
4. the path prioritise the area whose SOP overlaps with the SOPs carried by RREQ.
},
pages={6499 -6503},
keywords={cognitive radio networks;interflow interference;intraband backoff;joint ondemand routing;routing protocol;scheduling-based channel assignment;spectrum assignment;cognitive radio;routing protocols;scheduling;},
doi={10.1109/ICC.2007.1075},
ISSN={},}


@INPROCEEDINGS{Lin10Globecom,
author={Shih-Chun Lin, Kwang-Cheng Chen},
booktitle={GLOBECOM 2010, 2010 IEEE Global Telecommunications Conference}, title={spectrum aware opportunistic routing in cognitive radio network},
year={2010},
month=dec.,
volume={},
number={},
pages={1 -6},
keywords={},
doi={10.1109/GLOCOM.2010.5683964},
ISSN={1930-529X},
}

@INPROCEEDINGS{Khalife08_02,
author={Khalife, H. and Ahuja, S. and Malouch, N. and Krunz, M.},
booktitle={Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE}, title={Probabilistic Path Selection in Opportunistic Cognitive Radio Networks},
year={2008},
month=30 2008-dec. 4,
volume={},
number={},
pages={1 -5},
keywords={CR-to-CR link;channel capacity;most probable path;opportunistic cognitive radio networks;primary radio;probabilistic path selection;protocol;routing design;channel capacity;cognitive radio;multipath channels;probability;routing protocols;},
doi={10.1109/GLOCOM.2008.ECP.931},
ISSN={1930-529X},}

@inProceedings{willkomm08,
  author	= {Daniel Willkomm and Mathias Bohge and D{\'a}niel Holl{\'o}s and James Gross and Adam Wolisz},
  title		= {Double Hopping: A new Approach for Dynamic Frequency Hopping in Cognitive Radio Networks},
comment={  booktitle	= {Proceedings of the 19th {IEEE} International Symposium on Personal, Indoor and Mobile Radio Communications, 2008({PIMRC 2008})},},
    booktitle	= {Proc. of PIMRC 2008},
//year		= {2008},
//month		= sep,

  date		= {20080915},
  keywords =     {Cognitive Radio}
}

@inProceedings{Li11_ROSS,
  author	= {D. Li and J. Gross},
  title		= {Robust Clustering of Ad-hoc Cognitive Radio Networks under Opportunistic Spectrum Access},
    booktitle	= {Proc. of IEEE ICC '11},
 // year		= {2011},
  month		= Jun.,
  date		= {20080915},
  keywords =     {Cognitive Radio}
}

@inproceedings{Rao_withoutGPS_2003mobicom,
 author = {Rao, Ananth and Ratnasamy, Sylvia and Papadimitriou, Christos and Shenker, Scott and Stoica, Ion},
 title = {Geographic routing without location information},
 booktitle = {Proc. of ACM MobiCom '03},
}

@INPROCEEDINGS{Hyacinth,
author={Raniwala, A. and {Tzi-cker} Chiueh},
booktitle={Proc. of IEEE INFOCOM 2005}, 
title={Architecture and algorithms for an {IEEE} 802.11-based multi-channel wireless mesh network},
year={2005},
month={Mar.},
//volume={3},
number={},
keywords={ Hyacinth; IEEE 802.11; ISP; channel assignment; intelligent channel assignment; multi-channel wireless mesh network; multihop ad hoc networks; network interface cards; network throughput; radio spectrum; routing; wireless enterprise backbone network; wireless last-mile access network; ad hoc networks; channel allocation; telecommunication network routing; wireless LAN;},
doi={10.1109/INFCOM.2005.1498497},
ISSN={0743-166X },
}

@INPROCEEDINGS{VirtualFace2009infocom,
author={Ming-Jer Tsai and Fang-Ru Wang and Hong-Yen Yang and Yuan-Po Cheng},
booktitle={INFOCOM 2009, IEEE}, 
title={VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing Protocols in Wireless Sensor Networks},
year={2009},
month={april},
volume={},
number={},
pages={1728 -1736},
keywords={GLDR protocol;GLIDER protocol;Hop ID protocol;VCap protocol;VirtualFace algorithm;global positioning system;packet delivery;virtual face construction protocol;virtual face naming protocol;virtual-coordinate-based packet routing protocol;wireless sensor network;routing protocols;wireless sensor networks;},
doi={10.1109/INFCOM.2009.5062092},
ISSN={0743-166X},
}

@inproceedings{Kyasanur,
 author = {Kyasanur, Pradeep and Vaidya, Nitin H.},
 title = {Capacity of multi-channel wireless networks: impact of number of channels and interfaces},
 booktitle = {Proceedings of the 11th annual international conference on Mobile computing and networking},
 series = {MobiCom '05},
 year = {2005},
 isbn = {1-59593-020-5},
 location = {Cologne, Germany},
 pages = {43--57},
 numpages = {15},
 url = {http://doi.acm.org/10.1145/1080829.1080835},
 doi = {http://doi.acm.org/10.1145/1080829.1080835},
 acmid = {1080835},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {ad hoc networks, capacity, mesh networks, multiple channels, multiple interfaces},
}

@ARTICLE{Chowdhury,
author={Chowdhury, K.R. and Akyildiz, I.F.},
journal={Selected Areas in Communications, IEEE Journal on}, title={Cognitive Wireless Mesh Networks with Dynamic Spectrum Access},
year={2008},
month={jan. },
volume={26},
number={1},
pages={168 -181},
keywords={COMNET algorithmic framework;channel assignment;cognitive mesh network;cognitive radio;dynamic spectrum access;mesh protocol;mesh router;wireless LAN traffic;wireless mesh network;channel allocation;cognitive radio;protocols;radio access networks;spectral analysis;telecommunication network routing;telecommunication network topology;telecommunication traffic;wireless LAN;wireless channels;},
doi={10.1109/JSAC.2008.080115},
ISSN={0733-8716},}

@ARTICLE{WTRP,
author={Ergen, M. and Duke Lee and Raja Sengupta and Varaiya, P.},
journal={Vehicular Technology, IEEE Transactions on}, title={WTRP - wireless token ring protocol},
year={2004},
month={nov.},
volume={53},
number={6},
pages={ 1863 - 1881},
keywords={ QoS; WRTP; data forwarding; distributed protocol; finite state machines; home networking; intelligent transportation systems; interaccess point coordination; medium access control protocol; mission critical systems; mobile IP; quality of service; vehicle-to-vehicle communications; wireless local area network; wireless token ring protocol; IP networks; access protocols; finite state machines; mobile radio; quality of service; telecommunication network topology; wireless LAN;},
doi={10.1109/TVT.2004.836928},
ISSN={0018-9545},}

@INPROCEEDINGS{Zhu09,
author={Yajun Zhu and Zhenqiang Sun and Wei Wang and Tao Peng and Wenbo Wang},
booktitle={Proc. of IEEE WCNC 2009}, 
title={Joint Power and Rate Control Considering Fairness for Cognitive Radio Network},
year={2009},
month={Apr.},
volume={},
number={},
//pages={1-6},\n
keywords={asynchronous algorithm;cognitive radio network;duality theory;end-to-end rate control algorithm;interference temperature limits;optimal resource allocation;power control;cognitive radio;power control;telecommunication control;telecommunication network management;},
doi={10.1109/WCNC.2009.4917773},
ISSN={1525-3511},}

@INPROCEEDINGS{SenhuaHuang10,
author={Senhua Huang and Xin Liu and Zhi Ding},
booktitle={Proc. of IEEE INFOCOM 2010}, 
title={Distributed Power Control for Cognitive User Access based on Primary Link Control Feedback},
year={2010},
month={Mar.},
volume={},
number={},
//pages={1-9},\n
keywords={bi-directional nature;cognitive user access;distributed power control algorithms;higher spectrum usage;listen-before-talk strategy;primary link control feedback;primary user communications;secondary users communications;cognitive radio;distributed control;feedback;power control;radio links;telecommunication control;},
doi={10.1109/INFCOM.2010.5461916},
ISSN={0743-166X},}

@INPROCEEDINGS{wuinfocom09,
author={Yuan Wu and Tsang, D.H.K.},
booktitle={Proc. of IEEE INFOCOM 2009}, 
title={Distributed Power Allocation Algorithm for Spectrum Sharing Cognitive Radio Networks with QoS Guarantee},
year={2009},
month={Apr.},
volume={},
number={},
//pages={981 -989},\n
keywords={Lagrangian dual decomposition;Nash equilibrium;cochannel interference;cognitive radio;distributed power allocation;non-cooperative game;quality of service;spectrum sharing;cochannel interference;cognitive radio;game theory;quality of service;resource allocation;},
doi={10.1109/INFCOM.2009.5062009},
ISSN={0743-166X},
notes= {joint power and channel allocation 
decomposes the Lagrangian dual of the joint channel and power allocation problem, and propose a distributed scheme based on the dual parameters. The scheme converges to pure Nash equilibrium, but to facilitate this scheme, monitors are required to watch interference from secondary users, and moreover, monitors have to be equipped computational ability and interact with secondary users in the whole process of convergence.
}
}

@INPROCEEDINGS{Jaentti11,
author={Riku Jäntti and Jussi Kerttula and Konstantinos Koufos and Kalle Ruttik},
booktitle={Proc. of IEEE DySPAN 2011}, 
title={Aggregate interference with FCC and ECC white space usage rules: case study in Finland},
year={2011},
month={May},
volume={},
number={},
pages={},
keywords={},
doi={},
ISSN={},}

@INPROCEEDINGS{tvwhite_lte2011,
author={Muhammad Imadur Rahman and Ali Behravan and Havish Koorapaty and Joachim Sachs and Kumar Balachandran},
booktitle={Dyspan 2011, IEEE}, 
title={License-exempt {LTE} systems for secondary spectrum usage: scenarios and first assessment},
year={2011},
month={May},
volume={},
number={},
pages={},
keywords={},
doi={},
ISSN={},
//note={give a nice intro to TVWS usage,  EASIBILITY EVALUATIONS}
}

@INPROCEEDINGS{SenseLess2011,
author={R. Murty and R. Chandra and T. Moscibroda and V. Bahl},
booktitle={Proc. of IEEE DySpan 2011}, 
title={SenseLess: A Database-Driven White Spaces Network},
year={2011},
month={May},
volume={},
number={},
pages={},
keywords={},
notes={
neutral: only consider how to determine the set of available channels, deciding which channels among the available channels to used is not discussed.

1. demonstrate the feasibility of using suitable propagation models (Longley-Rice and terrain) to predict spectrum. All WSDs including BSs and clients rely solely on that.
2. terrain server cache and precomputation is used to ficilate system scalability.
0. consider availble channels for clients, as the the mobility issue of clients, protection regio which is bigger than actual distance between client and incumbent. clients must know their location in order to use the white space efficiently. using small granularity requires large amount infomation of channel availability for all grids, 'set-cover approximation algortihm' is used to decrease this.
0. The changes of TV transmitter is avergely once in 2 days.
con:
1. count the available channels based on the RSSI level of TV UHF signals.
},
doi={},
ISSN={},}

@INPROCEEDINGS{whitefi09,
author={Paramvir Bahl, Ranveer Chandra, Thomas Moscibroda, Rohan Murty and Matt Welsh},
booktitle={Proc. of ACM SIGCOMM 2009}, 
title={White Space Networking with {Wi-Fi} like Connectivity},
year={2009},
month={Aug.},
volume={},
number={},
pages={},
keywords={},
doi={},
ISSN={},}

@INPROCEEDINGS{zhu08Globecom, 
author={Guo-Mei Zhu and Akyildiz, I.F. and Geng-Sheng Kuo}, 
booktitle={Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE}, 
title={STOD-RP: A Spectrum-Tree Based On-Demand Routing Protocol for Multi-Hop Cognitive Radio Networks}, 
year={2008}, 
month={30 2008-dec. 4}, 
volume={}, 
number={}, 
pages={1 -5}, 
keywords={end-to-end delay;multihop cognitive radio networks;route selection;spectrum decision;spectrum-tree base ondemand routing protocol;cognitive radio;routing protocols;}, 
doi={10.1109/GLOCOM.2008.ECP.592}, 	
ISSN={1930-529X},}

@INPROCEEDINGS{Filippini09secon, 
author={Filippini, I. and Ekici, E. and Cesana, M.}, 
booktitle={Mobile Adhoc and Sensor Systems, 2009. MASS '09. IEEE 6th International Conference on}, 
title={Minimum maintenance cost routing in Cognitive Radio Networks}, 
year={2009}, 
month={oct.}, 
volume={}, 
number={}, 
pages={284 -293}, 
keywords={CRN;cognitive radio network channel;frequency-agile radio device;heuristic algorithm;integer programming optimization model;minimum maintenance cost routing;multihop end-to-end connection;polynomial time complexity;primary user activity;secondary user flow routing;spectrum availability;subsequent path selection;time varying network resource;cognitive radio;communication complexity;integer programming;minimisation;telecommunication network routing;wireless channels;}, 
doi={10.1109/MOBHOC.2009.5336987}, 
ISSN={},}

@TECHREPORT{LectureA, 
AUTHOR = {Martin Hoefer and Bethold Vöcking}, 
TITLE = {Algorithmische Spieltheorie: Congestion Games}, 
YEAR = {2010, Summer Semester}, 
INSTITUTION = {RWTH-Aachen University}, 
TYPE = {lecturenotes}, 
}

@INPROCEEDINGS{transmissionRange_connectedGraph, 
author={Xiaoyuan Ta and Guoqiang Mao and Anderson, B.D.O.}, 
booktitle={Communications and Networking in China, 2008. ChinaCom 2008. Third International Conference on}, 
title={On the connectivity properties of wireless multi-hop networks}, 
year={2008}, 
month={Aug.}, 
volume={}, 
number={}, 
//pages={959-963}, \n
keywords={Euclidean distance;connectivity properties;multihop network;transmission range;wireless ad hoc networks;wireless multihop networks;wireless sensor networks;ad hoc networks;wireless sensor networks;}, 
comments={The minimum transmssion range for high probability conneted is quantitatively investigated with the density of nodes. fig3 inllustrates the sudden change on connectivity with average node degree which is determined by the nodes density},
doi={10.1109/CHINACOM.2008.4685183}, 
ISSN={},}

@INPROCEEDINGS{multipleIntf_pimrc11, 
author={Koufos, Konstantinos and Ruttik, Kalle and Jantti, Riku}, 
booktitle={Proc. of IEEE PIMRC 2011}, 
title={Controlling the interference from multiple secondary systems at the {TV} cell border}, 
year={2011}, 
month={Sep.}, 
volume={}, 
number={}, 
//pages={645-649},
keywords={}, 
doi={10.1109/PIMRC.2011.6140042}, 
ISSN={pending},
notes={
pro: verify that in case the power density in each system is uniform, power planning can be formulated into a easy LP.
con: one channel scenario
};
}


@INPROCEEDINGS{aggregatedInf_Galindo_crowncom09, 
author={Galindo-Serrano, A. and Giupponi, L.}, 
booktitle={Proc. of CrownCom 2009}, 
title={Aggregated interference control for cognitive radio networks based on multi-agent learning}, 
year={2009}, 
month={Jun.}, 
volume={}, 
number={}, 
//pages={1 -6},
keywords={IEEE 802.22 standard;aggregated interference control;cognitive radio networks;decentralized Q-learning;multiagent reinforcement learning;wireless regional area networks;cognitive radio;interference suppression;learning (artificial intelligence);multi-agent systems;radio networks;}, 
doi={10.1109/CROWNCOM.2009.5188951}, 
notes={
what: Talk about how to distributedly decide SB's transmission power to avoid violating the interference threshold when multiple SBs are transmitting; 
This paper proposes a distribted learning scheme for each WRAN (a distributed algorithm), the evaluation function is somehow like a penalty function: c=(sinr_t1t - sinr_{th});;
con: WRAN 802.22 standard, each base station has its own 'control point', the SINR on the control point is used as the that of primary system;
power levels inmolved;
static, no margin for new SBs, when there is new SBs comes or a change of the WRAN network happens, power adjustment is needed;
1000 steps before convergence from simulation, no theorical complexity analysis;
Qos provided undedr the transmission power.
pro: Q-learning algorithm is said to have an optimal policy based on Bellman#s optimality. Q-learning records the cost over time.
},
ISSN={},}

@ARTICLE{DFH80222, 
author={Wendong Hu and Willkomm, D. and Abusubaih, M. and Gross, J. and Vlantis, G. and Gerla, M. and Wolisz, A.}, 
journal={Communications Magazine, IEEE}, 
title={COGNITIVE RADIOS FOR DYNAMIC SPECTRUM ACCESS - Dynamic Frequency Hopping Communities for Efficient IEEE 802.22 Operation}, 
year={2007}, 
month={may }, 
volume={45}, 
number={5}, 
pages={80 -87}, 
keywords={IEEE 802.22 operation;QoS satisfaction;WRAN;cognitive radio;dynamic frequency hopping communities;licensed user protection;reliable spectrum sensing;wireless regional area networks;cognitive radio;frequency hop communication;quality of service;telecommunication network reliability;}, 
doi={10.1109/MCOM.2007.358853}, 
notes={
0. sensing based 802.22.
1. A different channels is introduced to sense parallely with transmitting. then no time is sacrifised by sensing. Qos is guaranteed.
2. proposes the dynamic frequency hopping communities to share channels which are slightly more than the numbers of the community.
},
ISSN={0163-6804},}

@INPROCEEDINGS{centralizedSharing80222, 
author={Passiatore, C. and Camarda, P.}, 
booktitle={Proc. of IFIP Annual Mediterranean Ad Hoc Networking Workshop 2011}, 
title={A centralized inter-network resource sharing ({CIRS}) scheme in {IEEE} 802.22 cognitive networks}, 
volume={}, 
number={}, 
keywords={CIRS scheme;IEEE 802.22 standard;WRAN;centralized internetwork resource sharing scheme;cognitive radio network;collision free resource sharing method;interference;multichannel resource sharing scheme;primary user;resource distribution;spatial diversity;spectrum allocation;spectrum availability;spectrum scheduling;television broadcast service;wireless regional area network;IEEE standards;cognitive radio;interference suppression;radiofrequency interference;resource allocation;scheduling;telecommunication network reliability;television broadcasting;wireless channels;}, 
notes={
0. 802.22 style, 
1. cluster firstly, choose header, assign channels to non overlapping WRNs, and use time diviation (superframe) to avoid interference between WRNs. considering demand of different WRN.
2. centralized manner
3. power is not considered.
},
doi={10.1109/Med-Hoc-Net.2011.5970487}, 
ISSN={},}


@INPROCEEDINGS{accumInfCoverLoss_VTC11, 
author={Lu Ye and Zaixue Wei and Hong Du and Haodong Xie and Lin Sang and Dacheng Yang}, 
booktitle={Vehicular Technology Conference (VTC Fall), 2011 IEEE}, 
title={Accumulative Interference Modeling of Cellular CR Network to DTV System}, 
year={2011}, 
month={sept.}, 
volume={}, 
number={}, 
pages={1 -5}, 
keywords={CR system;DTV interference constraints;DTV system;accumulative interference modeling;cellular CR network;cognitive radio network;coverage area loss;digital television system;feasible network planning parameters;maximum transmitted power;minimum isolation distance;network parameters;sensing requirements;unused licensed spectrum;cellular radio;cognitive radio;digital television;radio spectrum management;radiofrequency interference;telecommunication network planning;television interference;}, 
notes={
1. this paper gives the math expression of cumulative interference from SB stations and terminals on the basis of a geometric model, and then investigates the relationship between the distance between the DTV station and SBs tier and the DTV coverage loss.
con1: although claimed by the authors that multichannel situation is considered, the cumulative interference obtained is still caused by SBs using the same channel.
con2: the transmission power of SBs and terminal are identical.
},
doi={10.1109/VETECF.2011.6092945}, 
ISSN={1090-3038},}

@INPROCEEDINGS{Wu_GOP_CA_08infocom, 
author={Fan Wu and Sheng Zhong and Chunming Qiao}, 
booktitle={Proc. of IEEE INFOCOM 2008}, 
title={Globally Optimal Channel Assignment for Non-Cooperative Wireless Networks}, 
year={2008}, 
month={Apr.}, 
volume={}, 
number={}, 
//pages={1543 -1551},
keywords={FDMA channel assignment;Nash Equilibrium;globally optimal channel assignment;noncooperative wireless networks;strategic game;strongly dominant strategy equilibrium;channel allocation;frequency division multiple access;game theory;radio networks;}, 
notes={
con1: The system model is simplified. The purpose is to maximize the sum of 'effecitive aggregate throughput' of all channels, while one certain channel's 'effecitive aggregate throughput' is a non increasing function of the number of radios using that channel.
con2: all players locate in the same collision domain, that is the reason for con1.
con3: all the other players' strategy is needed in each player's decision. while the exchange of such infomation is not mentioned.

pro1: a careful desined utility function drives players to arrive strongly dominate strategy equilibrium. 
pro2: a mechnism is proposed to cope with cheating, SDSE is also achieved.
pro3: fairness is obtained.
},
doi={10.1109/INFOCOM.2008.214}, 
ISSN={0743-166X},}

@INPROCEEDINGS{CA_Felegyhazi_07infocom, 
author={Felegyhazi, M. and Cagalj, M. and Bidokhti, S.S. and Hubaux, J.-P.}, 
booktitle={Proc. of IEEE INFOCOM 2007}, 
title={Non-Cooperative Multi-Radio Channel Allocation in Wireless Networks}, 
year={2007}, 
month={May}, 
volume={}, 
number={}, 
keywords={Nash equilibria;non-cooperative multi-radio channel allocation;wireless networks;channel allocation;wireless channels;}, 
notes={
similiar model with Wu_GOP_CA_08infocom, such as, all users work in the same single collision domain.
prove that the non-cooperative behavior of users leads to NE and load balancing.
},
doi={10.1109/INFCOM.2007.170}, 
ISSN={0743-166X},}

@ARTICLE{topology, 
author={Komali, R.S. and Thomas, R.W. and Dasilva, L.A. and Mackenzie, A.B.}, 
journal={Wireless Communications, IEEE Transactions on}, 
title={The price of ignorance: distributed topology control in cognitive networks}, 
year={2010}, 
month={april }, 
volume={9}, 
number={4}, 
pages={1434 -1445}, 
keywords={cognitive network;distributed topology control;maximum transmission power;power-efficiency objective;spectral-efficiency objective;cognitive radio;telecommunication network topology;}, 
notes={
!!!!!!!!!!!!!!!!!!!!!!!!!!!!
},
doi={10.1109/TWC.2010.04.090400}, 
ISSN={1536-1276},}

@inproceedings{GaoMibiHoc08,
 author = {Gao, Lin and Wang, Xinbing},
 title = {A game approach for multi-channel allocation in multi-hop wireless networks},
 booktitle = {Proc. of ACM MobiHoc 2008},
 series = {MobiHoc '08},
 year = {2008},
 isbn = {978-1-60558-073-9},
 location = {Hong Kong, Hong Kong, China},
 pages = {303--312},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/1374618.1374659},
 doi = {10.1145/1374618.1374659},
 acmid = {1374659},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {channel allocation, game theory, multi-radio, nash equilibria},
 notes={
 1. assume no-joint multiple paths are formed as priori, multiple radio and multiple channels, Channel allocation problem.
 
 2. argue the classical coaliation-proof Nash Equilibrium (CPNE) is not suitable for problem, and thus propose 'min-max coalition-proof nash equibrium' to fit the multipath channel allocation problem(the min of the coalition decide the performance of the whole coalition). The objective of the paper is to maximiza the minimum capacity of a player in one 'group'(link), so coalition is suitable.
 },
}

@INPROCEEDINGS{CApotentialLearning_05dyspan, 
author={Nie Nie and Cristina Comaniciu}, 
booktitle={Proc. of IEEE DySpan 2005}, 
title={Adaptive channel allocation spectrum etiquette for cognitive radio networks}, 
year={2005}, 
month={Nov.}, 
volume={}, 
number={}, 
//pages={269-278}, \n
keywords={Nash equilibrium point;cognitive radio network;distributed adaptive channel allocation;information exchange;network performance;noncooperative learning;spectrum etiquette;spectrum sharing game;channel allocation;cooperative systems;game theory;learning (artificial intelligence);radio networks;radio spectrum management;}, 
notes = {
adhoc channel assignment problem;
pro1: formulate CA into potentical game which leads to pure NE.
pro2: provides learning scheme, which achieves slightly better performance than that from potentical game
pro3: proposes a random access mechanism for decisison making, but a huge amount of info exchange is needed.

con1: not compare with global optimal.
con2: complexity is not analasied.
},
doi={10.1109/DYSPAN.2005.1542643}, 
ISSN={},
notes={mesh network; fixed sourse-destination pairs;
propose a compround metric for all channels, to avoid oscillation, the authors further propose a learning sheme which gives each channel a weight based on the metirc. The learning process is a game where players adopt mixed stratedy.
no common channel is required, a synchronization mechanism is provided.

authors integrete the external interference into the metric.

M_i is not clear....

compare with only one recent work.

};
}



@INPROCEEDINGS{qlearning_huang, 
author={Huang, J.W. and Quanyan Zhu and Krishnamurthy, V. and Basar, T.}, 
booktitle={Proc. of IEEE ICASSP 2010}, 
title={Distributed correlated Q-learning for dynamic transmission control of sensor networks}, 
year={2010}, 
month={Mar.}, 
volume={}, 
number={}, 
//pages={1982-1985}, \n
abstract={This paper considers a Markovian dynamical game theoretic setting for distributed transmission control in a wireless sensor network. The available spectrum bandwidth is modeled as a Markov chain. A distributed algorithm named correlated Q-learning algorithm is proposed to obtain the correlated equilibrium policies of the system. This algorithm has the decentralized feature and is easily implementable in a real system. Numerical example is also provided to verify the performances of the proposed algorithms.}, 
keywords={Markov chain;Markovian dynamical game theoretic setting;distributed algorithm;distributed correlated Q-learning;dynamic transmission control;spectrum bandwidth;wireless sensor network;Markov processes;distributed algorithms;game theory;wireless sensor networks;}, 
notes={Short while nice paper.no-regret learning is used to achieve correlated equilibrim, which is one the basis of the results from Q-learning.
},
doi={10.1109/ICASSP.2010.5495265}, 
ISSN={1520-6149},}


@INPROCEEDINGS{caps_potential2012, 
author={Latifa, B. and Zhenguo Gao and Sheng Liu}, 
booktitle={Computing, Communications and Applications Conference (ComComAp), 2012}, 
title={No-Regret learning for simultaneous power control and channel allocation in cognitive radio networks}, 
year={2012}, 
month={jan.}, 
volume={}, 
number={}, 
pages={267 -271}, 
abstract={In this paper, we investigate a no-regret learning algorithm for an exact potential game that allows cognitive radio pairs to update their transmission powers and frequencies simultaneously. We show by simulations that the No-regret algorithm converges to a pure Nash equilibrium, and that it achieves similar performance with the traditional game theoretic framework, while requiring less knowledge about the game and less implementation overhead.}, 
keywords={Nash equilibrium;channel allocation;cognitive radio network;exact potential game;game theoretic framework;no-regret learning algorithm;simultaneous power control;transmission frequency;transmission power;channel allocation;cognitive radio;game theory;learning (artificial intelligence);power control;radio spectrum management;}, 
notes={a bad imitation of NieNie's work.},
doi={10.1109/ComComAp.2012.6154855}, 
ISSN={},}

@INPROCEEDINGS{ca-game-2010infocom, 
author={Qing Yu and Jiming Chen and Yanfei Fan and Xuemin Shen and Youxian Sun}, 
booktitle={INFOCOM, 2010 Proceedings IEEE}, 
title={Multi-Channel Assignment in Wireless Sensor Networks: A Game Theoretic Approach}, 
year={2010}, 
month={march}, 
volume={}, 
number={}, 
pages={1 -9}, 
abstract={In this paper, we formulate multi-channel assignment in Wireless Sensor Networks (WSNs) as an optimization problem and show it is NP-hard. We then propose a distributed Game Based Channel Assignment algorithm (GBCA) to solve the problem. GBCA takes into account both the network topology information and transmission routing information. We prove that there exists at least one Nash Equilibrium in the channel assignment game. Furthermore, we analyze the sub-optimality of Nash Equilibrium and the convergence of the Best Response in the game. Simulation results are given to demonstrate that GBCA can reduce interference significantly and achieve satisfactory network performance in terms of delivery ratio, throughput, channel access delay and energy consumption.}, 
keywords={NP-hard;Nash equilibrium;channel access delay;channel assignment game;delivery ratio;distributed game based channel assignment algorithm;energy consumption;game theoretic approach;multichannel assignment;network topology information;optimization problem;transmission routing information;wireless sensor networks;game theory;optimisation;telecommunication network routing;telecommunication network topology;wireless channels;wireless sensor networks;}, 
doi={10.1109/INFCOM.2010.5461935}, 
ISSN={0743-166X},}

@ARTICLE{DAF-Krishnamurthy08, 
author={Krishnamurthy, V. and Maskery, M. and Yin, G.}, 
journal={Signal Processing, IEEE Transactions on}, title={Decentralized Adaptive Filtering Algorithms for Sensor Activation in an Unattended Ground Sensor Network}, 
year={2008}, 
month={dec. }, 
volume={56}, 
number={12}, 
pages={6086 -6101}, 
abstract={We present decentralized adaptive filtering algorithms for sensor activation control in an unattended ground sensor network (UGSN) comprised of ZigBee-enabled nodes. Nodes monitor their environment in a low-power ldquosleeprdquo mode, until an intruder is detected, then must decide whether to enter a full-power monitoring and transmission mode if their estimated average performance for activation outweighs their energy cost. The tradeoff is formulated in terms of the energy required to transmit data using the ZigBee protocol, probability of successful transmission, and the expected marginal increase in global utility resulting from a report, all of which depend on the activity of nearby sensor nodes. Since activation control is decentralized, and utilities are codependent, the adaptive filtering/stochastic approximation algorithms that we propose for sensor activation are based on game theoretic principles. We show that if each sensor operates according to this algorithm, the entire network is capable of actively tracking the correlated equilibrium set of the underlying game, which varies with target motion, node failures, or intentional parameter adjustments. We analyze the convergence and tracking properties of the adaptive filtering algorithms using differential inclusions.}, 
notes={
propose algorithms leading to correlated equilibrium
},
keywords={ZigBee protocol;ZigBee-enabled nodes;decentralized adaptive filtering;full-power monitoring;game theoretic principles;sensor activation control;stochastic approximation;target motion tracking;transmission mode;unattended ground sensor network;adaptive filters;game theory;protocols;target tracking;wireless sensor networks;}, 
doi={10.1109/TSP.2008.929664}, 
ISSN={1053-587X},}

@ARTICLE{cogCE_huang    , 
author={Huang, J.W. and Krishnamurthy, V.}, 
journal={IEEE Transactions on Communications}, 
title={Cognitive Base Stations in {LTE/3GPP} Femtocells: A Correlated Equilibrium Game-Theoretic Approach}, 
year={2011}, 
month={Dec.}, 
volume={59}, 
number={12}, 
pages={3485-3493}, 
abstract={This paper considers downlink spectrum allocation in a long term evolution (LTE) system macrocell which contains multiple femtocells. By incorporating cognitive capabilities into femtocell base stations, the Home evolved Node Bs (HeNBs) can be formulated as secondary base stations seeking to maximize the spectrum utility while minimizing interference to primary base stations (evolved Node-Bs). The competition amongst cognitive HeNBs for spectrum resources is formulated as a non-cooperative game-theoretic learning problem where each agent (HeNB) seeks to adapt its strategy in real time. We formulate the resource block (RB) allocation among HeNBs in the downlink of a LTE system using a game-theoretic framework, where the correlated equilibrium solutions of the formulated game are being investigated. A distributed RB access algorithm is proposed to compute the correlated equilibrium RB allocation policy..}, 
Notes={
formulate eNBs and HeNBs into primary and secondary uers respecitively, HeNBs compete with each other for the RBs left by the eNBs.

simulation parameters are somehow abstract for 'demonstratration purpose'.

utility is enlightful to further work of whitecat, which considers fairness and improve the performance of the worst user.


},


keywords={LTE/3GPP femtocells;cognitive base stations;correlated equilibrium game-theoretic approach;downlink spectrum allocation;long term evolution system macrocell;noncooperative game-theoretic learning problem;resource block allocation;3G mobile communication;Long Term Evolution;cognitive radio;game theory;}, 

doi={10.1109/TCOMM.2011.093011.100693}, 
ISSN={0090-6778},}

@inproceedings{DASinDTV09mobicom,
 author = {Deb, Supratim and Srinivasan, Vikram and Maheshwari, Ritesh},
 title = {Dynamic spectrum access in DTV whitespaces: design rules, architecture and algorithms},
 booktitle = {Proceedings of the 15th annual international conference on Mobile computing and networking},
 series = {MobiCom '09},
 year = {2009},
 isbn = {978-1-60558-702-8},
 location = {Beijing, China},
 pages = {1--12},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/1614320.1614322},
 doi = {10.1145/1614320.1614322},
 acmid = {1614322},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {DTV white space, dynamic spectrum, enterprize wireless lan},
}


@INPROCEEDINGS{CDSA07dyspan, 
author={Subramanian, A.P. and Gupta, H.}, 
booktitle={New Frontiers in Dynamic Spectrum Access Networks, 2007. DySpan 2007. 2nd IEEE International Symposium on}, 
title={Fast Spectrum Allocation in Coordinated Dynamic Spectrum Access Based Cellular Networks}, 
year={2007}, 
month={april}, 
volume={}, 
number={}, 
pages={320 -330}, 
abstract={Existing capacity constrained cellular networks that operate in fixed spectrum bands can be enhanced with capacity-on-demand services using the Coordinated Dynamic Spectrum Access (CDSA) model. In this model, a centralized spectrum broker coordinates access to spectrum in a given region and assigns short term spectrum leases to competing wireless service providers and/or end users. In contrast to existing multi-year cellular spectrum licenses that span large regions, a spectrum broker can grant spectrum leases that are for small regions (e.g.: per base station) and valid for short durations (e.g.: tens of minutes). Fast spectrum allocation algorithms are crucial to the design of scalable spectrum brokers that can provide such realtime spectrum access. In this paper, we address this challenge. Specifically, we formulate the spectrum allocation problem as two optimization problems: first with the objective of maximizing the overall demand (Max-Demand) satisfied among the various base stations and the second with the objective of minimizing the overall interference in the network (Min-Interference) when all the demands of the base stations are satisfied. We show that the optimization problems are NP-hard and design efficient algorithms to solve them. Our simulation results on sample network topologies show that our algorithms scale very well for large network sizes.}, 
keywords={NP-hard problem;capacity-on-demand service;cellular network;coordinated dynamic spectrum access model;fast spectrum allocation algorithm;optimization problem;cellular radio;frequency allocation;telecommunication network topology;}, 
doi={10.110	9/DYSPAN.2007.50}, 
ISSN={},}


@inproceedings{infmitigate07mobicom,
 author = {Ahmed, Nabeel and Shrivastava, Vivek and Mishra, Arunesh and Banerjee, Suman and Keshav, Srinivasan and Papagiannaki, Konstantina},
 title = {Interference mitigation in enterprise WLANs through speculative scheduling},
 booktitle = {Proc. of ACM MobiCom 2007},
 year = {2007},
 month={Sep.}, 
 isbn = {978-1-59593-681-3},
 location = {Montr\&\#233;al, Qu\&\#233;bec, Canada},
 //pages = {342--345},
 numpages = {4},
 url = {http://doi.acm.org/10.1145/1287853.1287900},
 doi = {10.1145/1287853.1287900},
 acmid = {1287900},
// publisher = {ACM},\n
 address_address = {New York, NY, USA},
 keywords = {centralization, conflict graph, interference, scheduling},
}

@INPROCEEDINGS{AdaptiveCA11, 
author={Nezhad, M.A. and Cerda-Alabern, L.}, 
booktitle={Mobile Adhoc and Sensor Systems (MASS), 2011 IEEE 8th International Conference on}, title={Adaptive Channel Assignment for Wireless Mesh Networks using Game Theory}, 
year={2011}, 
month={oct.}, 
volume={}, 
number={}, 
pages={746 -751}, 
abstract={Channel assignment has been extensively researched for multi-radio wireless mesh networks, but it is still very challenging when it comes to its implementation. In this paper we propose a semi-dynamic and distributed channel assignment mechanism called SICA that uses game theory. To the best of our knowledge this is the first game formulation of channel assignment which takes the co-channel interference into account. SICA is an interference aware, distributed channel assignment which preserves the network connectivity without relying on a common channel nor central node for coordination between mesh routers. SICA applies an on-line learner algorithm which assumes that nodes do not have perfect information. We have simulated SICA and compared against another interference-aware channel assignment mechanism proposed in the literature called Urban-X. Simulation results show that SICA outperforms Urban-X, even using fewer radio interfaces per node.}, 
keywords={SICA;Urban-X;adaptive channel assignment;co-channel interference;distributed channel assignment;game theory;interference-aware channel assignment mechanism;mesh routers;multiradio wireless mesh networks;online learner algorithm;radio interfaces;semi-dynamic and distributed channel assignment mechanism;channel allocation;cochannel interference;radio networks;telecommunication network routing;}, 
doi={10.1109/MASS.2011.82}, 
ISSN={2155-6806},}

@ARTICLE{powerchannel_2010, 
author={Anh Tuan Hoang and Ying-Chang Liang and Islam, M.H.}, 
journal={Mobile Computing, IEEE Transactions on},
title={Power Control and Channel Allocation in Cognitive Radio Networks with Primary Users' Cooperation}, 
year={2010}, 
month={march }, 
volume={9}, 
number={3}, 
pages={348-360}, 
abstract={We consider a point-to-multipoint cognitive radio network that shares a set of channels with a primary network. Within the cognitive radio network, a base station controls and supports a set of fixed-location wireless subscribers. The objective is to maximize the throughput of the cognitive network while not affecting the performance of primary users. Both downlink and uplink transmission scenarios in the cognitive network are considered. For both scenarios, we propose two-phase mixed distributed/centralized control algorithms that require minimal cooperation between cognitive and primary devices. In the first phase, a distributed power updating process is employed at the cognitive and primary nodes to maximize the coverage of the cognitive network while always maintaining the constrained signal to interference plus noise ratio of primary transmissions. In the second phase, centralized channel assignment is carried out within the cognitive network to maximize its throughput. Numerical results are obtained for the behaviors and performance of our proposed algorithms.}, 
keywords={base station controls;centralized channel assignment;channel allocation;constrained signal to interference plus noise ratio;distributed power updating process;downlink transmission scenarios;fixed-location wireless subscribers;mixed centralized control algorithm;mixed distributed control algorithm;point-to-multipoint cognitive radio network;power control;primary users cooperation;uplink transmission scenarios;channel allocation;cognitive radio;power control;radio networks;}, 
doi={10.1109/TMC.2009.136}, 
ISSN={1536-1233},}



@article{hart00correlatedeq,
    abstract = {{We propose a new and simple adaptive procedure for playing a game: "regret-matching." In this procedure, players may depart from their current play with probabilities that are proportional to measures of regret for not having used other strategies in the past. It is shown that our adaptive procedure guarantees that, with probability one, the empirical distributions of play converge to the set of correlated equilibria of the game.}},
    author = {Hart, Sergiu and Colell, {Andreu M.}},
    citeulike-article-id = {5253758},
    citeulike-linkout-0 = {http://dx.doi.org/10.2307/2999445},
    citeulike-linkout-1 = {http://www.jstor.org/stable/2999445},
    doi = {10.2307/2999445},
    issn = {00129682},
    journal = {Econometrica},
    keywords = {correlated\_equilibrium, multiagentlearning},
    number = {5},
    pages = {1127--1150},
    posted-at = {2010-09-23 16:57:17},
    priority = {2},
    publisher = {The Econometric Society},
    title = {{A simple adaptive procedure leading to correlated equilibrium}},
    url = {http://dx.doi.org/10.2307/2999445},
    volume = {68},
    year = {2000}}
    
@article{HoangPowerChannel2010,
     author = {Hoang, {Anh Tuan} and Liang, {Ying-Chang} and Islam, {Md Habibul}},
     title = {Power Control and Channel Allocation in Cognitive Radio Networks with Primary Users' Cooperation},
     notes = { % 1. proposes a distributed approach to decide the maximal transmission power for both primary and secondary users,
     A optimization problem is solved to decide the initial power levels for primary and secondary transmitters, then both primary and secondary transmitters increase power according a formula util either the SINR requirement on primary receivers are violated, or the maximal transmission power constraint is reached.
     
discusses power control and channel assignment in both downlink and uplink communication. PC is distributed where a learning algorithm is used, CA is executed in a centralized way. the model is based on 802.22.

note:
0. primary tramsmitters are required to coorperate with secondary networks. in the paper TRX perfers to use smaller power, (which is reasonable for less power consumption0 but the save of power if not illustrated.
1. DL and UL happen in one base station.
2. in power control, maximal transmission power is persued so as to extend the converage of the base station (for more end users)
3. In the process of power control in DL, primary receivers 'estimate' the SINR on them, what does that mean?

question
1. As to CA, as the sinr on each end users are decided according to (2), why not to choose c=argmax_c r.     
     
     },
     journal = {IEEE Transactions on Mobile Computing},
     issue_date = {March 2010},
     volume = {9},
     number = {3},
     month = mar,
     year = {2010},
     issn = {1536-1233},
     pages = {348--360},
     numpages = {13},
     url = {http://dx.doi.org/10.1109/TMC.2009.136},
     doi = {10.1109/TMC.2009.136},
     acmid = {1729618},
     publisher = {IEEE Educational Activities Department},
     address = {Piscataway, NJ, USA},
     keywords = {Wireless communications, Wireless communications, dynamic spectrum access, distributed control, joint power control and channel allocation., distributed control, dynamic spectrum access, joint power control and channel allocation.},
    }
    
    @inproceedings{MOBICOM10_retransmission,
 author = {Alicherry, Mansoor and Bhatia, Randeep and Li, Li (Erran)},
 title = {Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks},
 booktitle = {Proc. of ACM MobiCom '05}, 
 //booktitle = {Proceedings of the 11th annual international conference on Mobile computing and networking},
 year = {2005},
 isbn = {1-59593-020-5},
 location = {Cologne, Germany},
 pages = {58--72},
 numpages = {15},
 url = {http://doi.acm.org/10.1145/1080829.1080836},
 doi = {10.1145/1080829.1080836},
 acmid = {1080836},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {approximation algorithm, graph theory, mathematical programming, wireless mesh networks},
 notes = {goal: ca, routing, scheduling
system model: graph, transmission and interference range;
synchronazation;
maximize the one way communication from nodes to gateway (multipath). fairness is considered;
schedule achieves interference free link communication;
work:
testify the performance gain of using multiple radios and channels for wireless mesh network, in addition, proposes a algorithm;
a scheduling algorithm for sigle channel is firstly proposed, which is later extended for multi-channel. The schduling for the first T time slots are decided;
routing is formulated into LP. then channel assignment and scaling..in LP..;},
}


@INPROCEEDINGS{jointRoutingCA08, 
author={Wei Zhou and Xi Chen and Daji Qiao}, 
booktitle={Communications, 2008. ICC '08. IEEE International Conference on}, title={Practical Routing and Channel Assignment Scheme for Mesh Networks with Directional Antennas}, 
year={2008}, 
month={may}, 
volume={}, 
number={}, 
pages={3181 -3187}, 
keywords={IEEE 802.11 compliant devices;channel assignment scheme;commercial wireless networking devices;directional antennas;mixed integer programming problem;multi-radio network architecture;practical routing scheme;wireless broadband access;wireless mesh network;channel allocation;computational complexity;directive antennas;integer programming;interference suppression;radio networks;telecommunication network routing;wireless LAN;}, 
doi={10.1109/ICC.2008.599}, 
ISSN={},
notes= {routing+ca, directional antenna, centralized OP
Jain’s fairness index is used.
},
}

@INPROCEEDINGS{spectrum_auction_infocom10_linchen, 
author={Lin Chen and Iellamo, S. and Coupechoux, M. and Godlewski, P.}, 
booktitle={INFOCOM, 2010 Proceedings IEEE}, title={An Auction Framework for Spectrum Allocation with Interference Constraint in Cognitive Radio Networks}, 
year={2010}, 
month={march}, 
volume={}, 
number={}, 
pages={1 -9}, 
keywords={auction framework;cognitive radio networks;decentralized adaptive learning environments;distributed algorithm;interference temperature constraint;licensed primary users;noncontinuous two-dimensional optimization problem;noncooperative multiple-PU multiple-SU auction game;spectrum allocation mechanism;unlicensed secondary users;cognitive radio;distributed algorithms;frequency allocation;game theory;radiofrequency interference;}, 
doi={10.1109/INFCOM.2010.5462143}, 
notes={
0. deserve reading and learning
1. based on qlearning_huang, where one PU is considered
2. only SUs pairs, two subproblems: 1, SUs choose PU, 2, SUs choose power based on transmission power or SINR under the PU setting, which has NE
3. propose no-regret learning to achieve CE
},
ISSN={0743-166X},}

@ARTICLE{2011TWC_SSSMultiHopCR, 
author={Yong Xiao and Guoan Bi and Niyato, D.}, 
journal={Wireless Communications, IEEE Transactions on}, title={Game Theoretic Analysis for Spectrum Sharing with Multi-Hop Relaying}, 
year={2011}, 
month={may }, 
volume={10}, 
number={5}, 
pages={1527 -1537}, 
keywords={Nash equilibrium;Q-learning;distributed algorithms;game theoretic analysis;licensed spectrum;multihop relaying;multiuser cognitive radio networks;noncooperative game;optimal power allocation method;primary users;radiofrequency interference;relay selection algorithm;secondary users;source-to-destination pairs;spatial spectrum sharing;subgradient based power allocation algorithm;cognitive radio;game theory;radio networks;radio spectrum management;radiofrequency interference;}, 
doi={10.1109/TWC.2011.032411.100753}, 
notes={
1. assume multiple one hop links, (S_i, D_i).
2. general pricing policy: revenue is using PU's spectrum(with power) and serving other SUs. cost is being served by others.
3. assumption 3 is suspicious, about power: the capacity of any link is identical, so the transmission power is therefor decided.
4. pure NE is gotten out of a matrix form involved with 2 S-D paris. 
5. sub-gradient based power allocation, Q-laerning based raly selection

},
ISSN={1536-1276},}


@ARTICLE{TWC2012_cooperative_communication, 
author={Dan Wu and Yueming Cai and Liang Zhou and Jinlong Wang}, 
journal={IEEE Transactions on Wireless Communications, }, 
title={A Cooperative Communication Scheme Based on Coalition Formation Game in Clustered Wireless Sensor Networks}, 
year={2012}, 
month={march }, 
volume={11}, 
number={3}, 
pages={1190 -1200}, 
abstract={In this work, we study the problem of how to strike a balance between the QoS provisioning and the energy efficiency when a cooperative communication scheme is applied to a clustered wireless sensor network. Specifically, we first characterize the tradeoff by a multi-variable optimization problem, with the goal of balancing the outage performance and the network lifetime. Then, we horizontally decompose the problem into the concatenation of two subproblems: i) the long-haul transmit power per sensor node, and ii) the set of assisting cluster nodes. For the former one, an optimal long-haul transmit power solution is proposed based on the Lambert W function. The latter one is modeled as a coalition formation game, where the characteristic function is designed based on the combination of the former subproblem's results. Furthermore, an optimal algorithm is proposed by using a dynamic coalition formation process based on the best-reply process with trial opportunity. Extensive simulation results are presented to demonstrate the effectiveness of our proposed scheme.}, 
keywords={Lambert W function;QoS provisioning;clustered wireless sensor networks;coalition formation game;cooperative communication;dynamic coalition formation process;energy efficiency;long-haul transmit power per sensor node;multivariable optimization problem;optimal algorithm;optimal long-haul transmit power solution;cooperative communication;optimisation;wireless sensor networks;}, 
doi={10.1109/TWC.2012.012712.111049}, 
notes={
xxxxxxxxx

},
ISSN={1536-1276},}

@INPROCEEDINGS{4025003, 
author={Qinghai Gao and Junshan Zhang and Larish, B. and Shen, S.}, 
booktitle={Communications, 2006. ICC '06. IEEE International Conference on}, title={Coalition-aided Data Transmissions in Wireless Sensor Networks}, 
year={2006}, 
month={june }, 
volume={8}, 
number={}, 
pages={3426 -3431}, 
abstract={We study cooperative data transmissions in coalition-based wireless sensor networks, where neighboring nodes are organized into groups to form coalitions. We assume that data compression and cooperative communications can be carried out within one coalition, and that CSMA is used to reserve the channel from the coalitions to the sink. We examine three schemes for data transmissions from the coalition (with reservation) to the sink. In Scheme 1, one node in the coalition is selected randomly to transmit the data; in Scheme 2, the node with the best channel condition in the coalition transmits the data; and in Scheme 3, all the nodes in the coalition transmit in a cooperative manner. We investigate the corresponding delay performance and the energy consumption of the three schemes. Our numerical examples show that significant gains can be achieved by the coalition-aided transmission schemes, and as expected, Scheme 3 achieves the best performance.}, 
keywords={}, 
doi={10.1109/ICC.2006.255602}, 
notes={
xxxxxxxxxxxxxxxxxxx

},
ISSN={8164-9547},}


@INPROCEEDINGS{Saad_coalitionMIMO08, 
author={Saad, W. and Zhu Han and Debbah, M. and Hjorungnes, A.}, 
booktitle={Communications Workshops, 2008. ICC Workshops '08. IEEE International Conference on}, title={A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks}, 
year={2008}, 
month={may}, 
volume={}, 
number={}, 
pages={311 -315}, 
abstract={This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge and split algorithm for coalition formation is constructed. This algorithm is applied to study the gains resulting from the cooperation among single antenna transmitters for virtual MIMO formation. The aim is to find an ultimate transmitters coalition structure that allows cooperating users to maximize their utilities while accounting for the cost of coalition formation. Through this novel game theoretical framework, the wireless network transmitters are able to self-organize and form a structured network composed of disjoint stable coalitions. Simulation results show that the proposed algorithm can improve the average individual user utility by 26.4% as well as cope with the mobility of the distributed users.}, 
keywords={  theory;distributed merge algorithm;distributed split algorithm;single antenna transmitter;virtual MIMO formation;wireless networks;MIMO communication;distributed algorithms;game theory;radio networks;transmitting antennas;}, 
doi={10.1109/ICCW.2008.65}, 
ISSN={},}

@INPROCEEDINGS{FormationGame08, 
author={Saad, W. and Zhu Han and Debbah, M. and Hjorungnes, A.}, 
booktitle={Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE}, 
title={Network Formation Games for Distributed Uplink Tree Construction in IEEE 802.16J Networks}, 
year={2008}, 
month={30 2008-dec. 4}, 
volume={}, 
number={}, 
pages={1 -5}, 
abstract={This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16J network's relay stations (RSs) and their serving base station (MR-BS). We model the problem as a network formation game in which the RSs want to form a directed tree graph to improve their utility, in terms of the packet success rate (PSR), by using multi-hop cooperative transmission while accounting for a link maintenance cost. In this game, the relay stations engage in bilateral negotiations which result in a contractual agreement to form a directed link between each pair. For network dynamics, we propose an algorithm based on the local best responses of the RSs that converges to a local Nash network. Moreover, the proposed dynamics algorithm allows the RSs to autonomously adapt the network topology to changes in the environment due to mobility or to the presence of heterogeneous traffic. Simulation results show how the RSs can self-organize in a tree structure while improving the network's overall PSR up to 19.7% and 17.3% compared, respectively, to the cases where no RSs exist and where the RSs are directly connected to the MR-BS.}, 
notes={

utilize myopic strategy to form a tree structure which is also a local nash, the algorithm is from \cite{wine08}, the downside is there is only one path for each relay.
Evebtually, there is only one path (the one with the best BER metric, but is this path unaffected by the dynamics caused by other relay nodes?) for each relay node, 
convergence to local nash equilibrium is not proved!

},
keywords={IEEE 802.16J networks;Nash networks;base station;distributed uplink tree construction;multi-hop cooperative transmission;network formation games;network topology;packet success rate;relay stations;uplink tree structure;IEEE standards;WiMax;broadband networks;radio access networks;telecommunication network topology;}, 
doi={10.1109/GLOCOM.2008.ECP.987}, 
ISSN={1930-529X},}


@INPROCEEDINGS{selectionEvolution10, 
author={Zhu, Kun and Niyato, Dusit and Wang, Ping}, 
booktitle={Wireless Communications and Networking Conference (WCNC), 2010 IEEE}, title={Network Selection in Heterogeneous Wireless Networks: Evolution with Incomplete Information}, 
year={2010}, 
month={april}, 
volume={}, 
number={}, 
pages={1 -6}, 
abstract={Enabling users to connect to the best available network, dynamic network selection scheme is important for satisfying various quality of service #40;QoS #41; requirements, achieving seamless mobility and load balancing in heterogeneous wireless networks. In this paper, we formulate the network selection problem in heterogeneous wireless networks with incomplete information as a Bayesian game. In general, the preference #40;i.e., utility #41; of a mobile user is private information. Therefore, each user has to make the decision of network selection optimally given only the partial information of the preferences of other users. To study the dynamics of such network selection, the Bayesian best response dynamics and aggregate best response dynamics are applied. Bayesian Nash equilibrium is considered to be the solution of this game, and there is a one-to-one mapping between the Bayesian Nash equilibrium and the equilibrium distribution of the aggregate dynamics. The numerical results show the convergence of the aggregate best response dynamics for this Bayesian network selection game. This result ensures that even with incomplete information, the equilibrium of network selection decisions of mobile users can be reached.}, 
notes={
also muiltihoming problem- professor Yezekael Hayel
},
keywords={}, 
doi={10.1109/WCNC.2010.5506371}, 
ISSN={1525-3511},}

@INPROCEEDINGS{HeINFOCOM11_StackelbergPower, 
author={Gaoning He and Lasaulce, S. and Hayel, Y.}, 
booktitle={INFOCOM, 2011 Proceedings IEEE}, title={Stackelberg games for energy-efficient power control in wireless networks}, 
year={2011}, 
month={april}, 
volume={}, 
number={}, 
pages={591 -595}, 
abstract={This paper addresses the power control problem in wireless networks where transmitters choose their control policy freely and selfishly in order to maximize their individual energy-efficiency. In this framework, two new scenarios are studied in details: 1. a scenario where a fraction of the transmitters can observe the power levels of the other transmitters while the latter have no sensing capabilities; 2. a scenario where the observation structure is triangular, that is, the kth transmitter can observe the k - 1th transmitters (which corresponds to a multi-level hierarchical game). In both scenarios the equilibrium analysis (existence, uniqueness, determination, efficiency) is conducted. In scenario 1, it is proved that the game outcome Pareto dominates the one obtained when no transmitters can sense the others. Taking the sensing cost into account, a simple condition under which being a follower (namely a transmitter who senses) is better than a leader is provided. Interestingly, the existence of an optimum fraction of cognitive transmitters in terms of sum utility is proved in the case where the sensing cost is neglected. In scenario 2, it is proved analytically that knowing more leads to a better utility and the game outcome Pareto dominates the solution with no sensing. The derived results are illustrated by numerical results and provide some insights on how to deploy cognitive radios in heterogeneous networks in terms of sensing capabilities.}, 

notes={
xxxxxxxxxxxxxxx
},

keywords={Stackelberg games;cognitive transmitters;energy-efficiency;energy-efficient power control;equilibrium analysis;heterogeneous networks;multilevel hierarchical game;wireless networks;game theory;power control;radio networks;telecommunication control;}, 
doi={10.1109/INFCOM.2011.5935233}, 
ISSN={0743-166X},}

@ARTICLE{multihopDiversity04, 
author={Boyer, J. and Falconer, D.D. and Yanikomeroglu, H.}, 
journal={Communications, IEEE Transactions on}, title={Multihop diversity in wireless relaying channels}, 
year={2004}, 
month={oct.}, 
volume={52}, 
number={10}, 
pages={ 1820 - 1830}, 
abstract={ This paper presents theoretical characterizations and analysis for the physical layer of multihop wireless communications channels. Four channel models are considered and developed: the decoded relaying multihop channel; the amplified relaying multihop channel; the decoded relaying multihop diversity channel; and the amplified relaying multihop diversity channel. Two classifications are discussed: decoded relaying versus amplified relaying, and multihop channels versus multihop diversity channels. The channel models are compared, through analysis and simulations, with the "singlehop" (direct transmission) reference channel on the basis of signal-to-noise ratio, probability of outage, probability of error, and optimal power allocation. Each of the four channel models is shown to outperform the singlehop reference channel under the condition that the set of intermediate relaying terminals is selected intelligently. Multihop diversity channels are shown to outperform multihop channels. Amplified relaying is shown to outperform decoded relaying despite noise propagation. This is attributed to the fact that amplified relaying does not suffer from the error propagation which limits the performance of decoded relaying channels to that of their weakest link.}, 
notes={
introduces four ways to conduct multihop transmission.
},
keywords={ ad-hoc networks; amplified relaying multihop diversity channel; cooperative diversity; decoded relaying multihop diversity channel; error probability; feedback interference; feedforward interference; mesh networks; multihop wireless communications channels; outage probability; power allocation; reference channel; signal-to-noise ratio; wireless relaying; ad hoc networks; channel coding; decoding; diversity reception; error statistics; mobile radio; probability; radiofrequency interference; telecommunication channels; telecommunication terminals;}, 
doi={10.1109/TCOMM.2004.836447}, 
ISSN={0090-6778},}

@INPROCEEDINGS{localdynamicsFormation08, 
author={Arcaute, E. and Johari, R. and Mannor, S.}, 
booktitle={Allerton Conference 2008}, 
title={Local dynamics for network formation games}, 
year={2008}, 
month={Sep.}, 
volume={}, 
number={}, 
//pages={937-938},
abstract={Network formation games capture two conflicting objectives of self-interested nodes in a network. On one hand, such a node wishes to be able to reach all other nodes in the network; on the other hand, it wishes to minimize its cost of participation. We focus on myopic dynamics in a class of such games inspired by transportation and communication models. A key property of the dynamics we study is that they are local: nodes can only deviate to form links with others in a restricted neighborhood. Despite this locality, we find that our dynamics converge to efficient or nearly efficient outcomes in a range of settings of interest.}, 
notes={
The theoritical basis of FormationGame08. 
},
keywords={local dynamics;myopic dynamics;network formation games;self-interested nodes;game theory;}, 
doi={10.1109/ALLERTON.2008.4797658}, 
ISSN={},}


@misc{ecc159,
Author={},
url = "http://www.erodocdb.dk/docs/doc98/official/Pdf/ECCRep159.pdf",
Howpublished={\url{http://www.erodocdb.dk/docs/doc98/official/Pdf/ECCRep159.pdf}},
Title="{Technical and operational requirements for the possible operation of cognitive radio systems in the 'white spaces' of the frequency band 470-790 MHz, Cardiff}",
  month={Jan.},
  year = {2011}, 
note="Visited July 2012"
}

@misc{FCC_2010_sedond_memorandumm,
title={In the matter of unlicensed operation in the {TV} broadcast bands: second memorandum opinion and order, Federal Communications Commission, FCC 10-174},
howpublished = "\url{http://hraunfoss.fcc.gov/edocs_public/attachmatch/DA-11-131A1.pdf}",
month={Jan.},
year={2011},
note="Visited July 2012"
}

@misc{FCCdatabasae,
  author = {},
  howpublished = "\url{http://hraunfoss.fcc.gov}",
  url="http://hraunfoss.fcc.gov/edocs_public/attachmatch/DOC-301650A1.pdf",  
  Title = {{FCC} Frees Up Vacant {TV} Airwaves for ”{S}uper {W{i-{F{i” Technologies and Other Technologies}}}}},
  month={Sep.},
  year = {2010}, 
  note="Visited July 2012"
}




@misc{WRF,
key="WRF",
title={Weather Research Forecasting (WRF) Model},
year="2005",
howpublished="\url{http://wrf-model.org}",
note="Visited July 2010"
}

@misc{cvx,
  author       = {M. Grant and S. Boyd},
  title        = {{CVX}: Matlab Software for Disciplined Convex
                  Programming, version 1.21},
  howpublished = "\url{http://cvxr.com/cvx/cvx_usrguide.pdf}",
  month        = apr,
  year         = 2011
  note="Visited July 2010"
}





@INPROCEEDINGS{dispower_stochansticUtility11icc, 
author={Lei Yang and Sagduyu, Y.E. and Junshan Zhang and Li, J.H.}, 
booktitle={Communications (ICC), 2011 IEEE International Conference on}, 
title={Distributed Power Control for Ad-Hoc Communications via Stochastic Nonconvex Utility Optimization}, 
year={2011}, 
month={june}, 
volume={}, 
number={}, 
pages={1 -5}, 
abstract={It is known that distributed power control in wireless ad-hoc networks is challenging, due to the inherent global coupling between concurrent transmissions interfering with each other. Observing that the globally optimal point lies on the boundary of the feasible region, we transform the utility maximization problem into a more structured problem in the form of maximizing the minimum weighted utility. Then, we develop a centralized algorithm for the minimum weighted utility maximization problem as a benchmark. Next, by using extended duality theory, we introduce penalty multipliers and decompose the minimum weighted utility maximization problem into subproblems for individual users. Appealing to the simulated annealing method, we propose a distributed stochastic power control algorithm, where each user stochastically adjusts its target utility to improve the overall system utility. Although the underlying optimization problem is nonconvex, our algorithm can guarantee global optimality although the convergence rate may be slow due to the usage of simulated annealing. We improve the convergence rate further by devising an enhanced algorithm based on the geometric cooling schedule.}, 
keywords={centralized algorithm;concurrent transmission;distributed stochastic power control algorithm;extended duality theory;geometric cooling schedule;inherent global coupling;minimum weighted utility maximization problem;penalty multiplier;simulated annealing method;stochastic nonconvex utility optimization;wireless ad-hoc network;ad hoc networks;concave programming;distributed control;duality (mathematics);power control;simulated annealing;stochastic processes;telecommunication control;}, 
doi={10.1109/icc.2011.5962986}, 
ISSN={1550-3607},
note: 1. one channel
2, slow because applying simulated annealing

}

@ARTICLE{nashbargaining_2012jsac, 
author={Qiang Ni and Zarakovitis}, 
journal={IEEE Journal on Selected Areas in Communications}, 
title={Nash Bargaining Game Theoretic Scheduling for Joint Channel and Power Allocation in Cognitive Radio Systems}, 
year={2012}, 
month={Jan.}, 
volume={30}, 
number={1}, 
pages={70 -81}, 
abstract={This paper proposes a new Nash bargaining solution (NBS) based cooperative game-theoretic scheduling framework for joint channel and power allocation in orthogonal frequency division multiple access cognitive radio (CR) systems. Our objectives are to maximize the overall throughput of the CR system with the protection of primary users' transmission, while guaranteeing each CR user's minimum rate requirement and the proportional fairness and efficient power distribution among CR users. Using time-sharing variable transformation, we introduce a novel method that involves Lambert-W function properties and obtain closed-form analytical solutions. A low-complexity algorithm is also developed which does not require iterative processes as usual to search the optimal solution numerically. Simulation results demonstrate that our optimal policies outperform the existing maximal rate, fixed assignment and max-min fairness, while achieving the 99.985% in average of the optimal capacity.}, 
keywords={Lambert W function properties;Nash bargaining game theoretic scheduling;closed form analytical solutions;cognitive radio systems;cooperative game theoretic scheduling framework;joint channel and power allocation;low complexity algorithm;power distribution;time sharing variable transformation;cognitive radio;cooperative communication;frequency division multiple access;game theory;}, 
doi={10.1109/JSAC.2012.120107}, 
ISSN={0733-8716},
note= centralized!
deal with interaction among terminals
}

@ARTICLE{sumrateMax_jasc11, 
author={Honghai Zhang and Venturino, L. and Prasad, N. and Peilong Li and Rangarajan, S. and Xiaodong Wang}, 
journal={Selected Areas in Communications, IEEE Journal on}, 
title={Weighted Sum-Rate Maximization in Multi-Cell Networks via Coordinated Scheduling and Discrete Power Control}, 
year={2011}, 
month={june }, 
volume={29}, 
number={6}, 
pages={1214 -1224}, 
notes={disributed scheme;
the metric is the rate of one end user which may be different in each iteration.
Initialization: find hte best end user.
	iteration: step1. find the best power level;
			   step2: find the best end user.
			   
It is magic prove convergence through markov chain.
i am not suer about IM
},
abstract={Inter-cell interference mitigation is a key challenge in the next generation wireless networks which are expected to use an aggressive frequency reuse factor and a high-density base station deployment to improve coverage and spectral efficiency. In this work, we consider the problem of maximizing the weighted sum-rate of a wireless cellular network via coordinated scheduling and discrete power control. We present two distributed iterative algorithms which require limited information exchange and data processing at each base station. Both algorithms provably converge to a solution where no base station can unilaterally modify its status (i.e., transmit power and user selection) to improve the weighted sum-rate of the network. Numerical studies are carried out to assess the performance of the proposed schemes in a realistic system based on the IEEE 802.16m specifications. Simulation results show that the proposed algorithms achieve a significant rate gain over uncoordinated transmission strategies for both cell-edge and inner users.}, 
keywords={IEEE 802.16m specification;aggressive frequency reuse factor;coordinated scheduling;discrete power control;distributed iterative algorithm;high-density base station deployment;intercell interference mitigation;multicell network;next generation wireless network;spectral efficiency;weighted sum-rate maximization;wireless cellular network;WiMax;cellular radio;next generation networks;power control;scheduling;telecommunication control;}, 
doi={10.1109/JSAC.2011.110609}, 
ISSN={0733-8716},}

@INPROCEEDINGS{ca_sdr_mass11, 
author={Ying Dai and Jie Wu}, 
booktitle={Mobile Adhoc and Sensor Systems (MASS), 2011 IEEE 8th International Conference on}, 
title={Efficient Channel Assignment under Dynamic Source Routing in Cognitive Radio Networks}, 
year={2011}, 
month={oct.}, 
volume={}, 
number={}, 
pages={550 -559}, 
abstract={The channel assignment problem is one of the most important issues in cognitive radio networks (CRNs). Under a SINR-driven model, we consider channel assignments in a network using dynamic source routing (DSR). In this unicasting model, channel assignments are conducted in a relatively small scale of nodes, which are on the chosen route. In addition, we can make use of the route reply (RREP) message in DSR to estimate the SINR and the maximum data transmission rate of nodes on the chosen route. In this way, the source node can conduct the channel assignment in a more efficient way. We propose two algorithms for the single route and multi-route channel assignments, where the multi-route scheme uses alternative nodes to help transmitting. We give a complexity analysis of two algorithms and an extension of reducing complexity for the multi-route channel assignment algorithm. Finally, we conduct simulations of our two algorithms under networks with different densities and show that the performance of our algorithms is efficient.}, 
keywords={CRN;DSR;RREP message;SINR-driven model;cognitive radio networks;complexity analysis;data transmission rate;dynamic source routing;multiroute channel assignment algorithm;multiroute channel assignments;multiroute scheme;route reply message;single route channel assignment;source node;unicasting model;channel allocation;cognitive radio;communication complexity;telecommunication network routing;}, 
doi={10.1109/MASS.2011.58}, 
ISSN={2155-6806},}





@INPROCEEDINGS{clusterRoutingOverhead_wcnc04, 
author={Wu, H. and Abouzeid, A.A.}, 
booktitle={Proceedings of IEEE WCNC 2004}, 
title={Cluster-based routing overhead in networks with unreliable nodes}, 
year={2004}, 
month={march}, 
volume={4}, 
number={}, 
pages={ 2557 - 2562 Vol.4}, 
abstract={ While several cluster based routing algorithms have been proposed for ad hoc networks, there is a lack of formal mathematical analysis of these algorithms. Specifically, there is no published investigation of the relation between routing overhead on one hand and route request pattern (traffic) on the other. This paper provides a mathematical framework for quantifying the overhead of a cluster-based routing protocol. We explicitly model the application-level traffic in terms of the statistical description of the number of hops between a source and a destination. The network topology is modelled by a regular two-dimensional grid of unreliable nodes, and expressions for various components of the routing overhead are derived. The results show that clustering does not change the traffic requirement for infinite scalability compared to flat protocols, but reduces the overhead by a factor of O(1/M) where M is the cluster size. The analytic results are validated against simulations of random network topologies running a well known (D-hop max-min) clustering algorithm.}, 
keywords={ D-hop max-min clustering algorithm; ad hoc networks; application-level traffic; cluster-based routing protocol; mathematical framework; network topology; routing overhead; statistical description; two-dimensional grid; unreliable nodes; ad hoc networks; network topology; pattern clustering; routing protocols; statistical analysis; telecommunication network reliability; telecommunication traffic;}, 
doi={10.1109/WCNC.2004.1311491}, 
ISSN={1525-3511},}

@INPROCEEDINGS{SensorDeployment-Infocom2012, 
author={Shuguang Xiong and Lei Yu and Haiying Shen and Chen Wang and Wei Lu}, 
booktitle={INFOCOM, 2012 Proceedings IEEE}, title={Efficient algorithms for sensor deployment and routing in sensor networks for network-structured environment monitoring}, 
year={2012}, 
month={march}, 
volume={}, 
number={}, 
pages={1008 -1016}, 
abstract={When monitoring environments with wireless sensor networks, optimal sensor deployment is a fundamental issue and an effective means to achieve desired performance. Selecting best sensor deployment has a dependence on the deployment environments. Existing works address sensor deployment within three types of environments including one dimensional line, 2-D field and 3-D space. However, in many applications the deployment environments usually have network structures, which cannot be simply classified as the three types. The deployed locations and communications of sensor nodes are limited onto the network edges, which make the deployment problem distinct from that in other types of environments. In this paper, we study sensor deployment in network-structured environments and aim to achieve k-coverage while minimizing the number of sensor nodes. Furthermore, we jointly consider the optimization of sink deployment and routing strategies with the goal to minimize the network communication cost of data collection. To the best of our knowledge, this paper is the first one to tackle sensor/sink deployment under the deployment constraints imposed by the network structure. The hardness of the problems is shown. Polynomial-time algorithms are proposed to determine optimal sensor/sink deployment and routing strategies in tree-topology network structure. Efficient approximation algorithms are proposed for the general graph network structure and their performances are analyzed. Theoretical results and extensive simulations show the efficiency of the proposed algorithms.}, 
notes={sensors deployment, sinks chosen, routing design!},
keywords={data collection;hard problems;k-coverage;network communication cost;network structured environment monitoring;polynomial time algorithms;sensor deployment;sensor network routing;wireless sensor network;optimisation;sensor placement;telecommunication network routing;telecommunication network topology;trees (mathematics);wireless sensor networks;}, 
doi={10.1109/INFCOM.2012.6195455}, 
ISSN={0743-166X},}

@INPROCEEDINGS{proactiveDirectionBasedRouting_CCNC06, 
author={ Yang Li and Hong Man}, 
booktitle={Consumer Communications and Networking Conference, 2006. CCNC 2006. 3rd IEEE}, 
title={A proactive direction based routing for directional ad hoc networks}, 
year={2006}, 
month={jan.}, 
volume={1}, 
number={}, 
pages={ 416 - 420}, 
abstract={Not available}, 
keywords={}, 
doi={10.1109/CCNC.2006.1593058}, 
ISSN={},}


@INPROCEEDINGS{directionality_mobile_routing_mass08, 
author={Bow-Nan Cheng and Yuksel, M. and Kalyanaraman, S.}, 
booktitle={Mobile Ad Hoc and Sensor Systems, 2008. MASS 2008. 5th IEEE International Conference on}, title={Using directionality in mobile routing}, 
year={2008}, 
month={29 2008-oct. 2}, 
volume={}, 
number={}, 
pages={371 -376}, 
abstract={The increased usage of directional methods of communications has prompted research into leveraging directionality in every layer of the network stack. In this paper, we explore the use of directionality in layer 3 to facilitate routing in highly mobile environments. We introduce mobile orthogonal rendezvous routing protocol (MORRP), a lightweight, but scalable routing protocol utilizing directional communications (such as directional antennas or free-space-optical transceivers) to relax information requirements such as coordinate space embedding, node localization, and mobility. This relaxation is done by introducing a novel concept called the directional routing table (DRT) which maps a set-of-IDs to each directional interface to provide probabilistic routing information based on interface direction. We show that MORRP achieves connectivity with high probability even in highly mobile environments while maintaining only probabilistic information about destinations. We also compare MORRP with various proactive, reactive, and position-based routing protocols using single omni-directional interfaces and 8 directional interfaces and show that MORRP gains over 10-14X additional goodput vs. traditional protocols and 15-20% additional goodput vs. traditional protocols using multiple interfaces.}, 
keywords={coordinate space embedding;directional communications;directional routing table;directionality;mobile orthogonal rendezvous routing protocol;mobility;node localization;scalable routing protocol;mobile radio;routing protocols;}, 
doi={10.1109/MAHSS.2008.4660023}, 
ISSN={},}

@article{multipath_cognitive_11,
 author = {Javadi, Farshad and Jamalipour, Abbas},
 title = {A multi-path cognitive resource management mechanism for QoS provisioning in wireless mesh networks},
 journal = {Wirel. Netw.},
 issue_date = {January   2011},
 volume = {17},
 number = {1},
 month = jan,
 year = {2011},
 issn = {1022-0038},
 pages = {277--290},
 numpages = {14},
 url = {http://dx.doi.org/10.1007/s11276-010-0279-6},
 doi = {10.1007/s11276-010-0279-6},
 acmid = {1938076},
 publisher = {Kluwer Academic Publishers},
 address = {Hingham, MA, USA},
 keywords = {Cognitive networks, QoS provisioning, Resource management, Wireless Mesh Networks},
}

@INPROCEEDINGS{uplink_reuse_gao_infocom12, 
author={Bo Gao and Jung-Min Park and Yaling Yang}, 
booktitle={INFOCOM, 2012 Proceedings IEEE}, 
title={Uplink soft frequency reuse for self-coexistence of cognitive radio networks operating in white-space spectrum}, 
year={2012}, 
month={march}, 
volume={}, 
number={}, 
pages={1566 -1574}, 
abstract={Recent advances in cognitive radio (CR) technology have brought about a number of wireless standards that support opportunistic access to available white-space spectrum. Addressing the self-coexistence of CR networks in such an environment is very challenging, especially when coexisting networks operate in the same swath of spectrum with little or no direct coordination. In this paper, we study the problem of co-channel self-coexistence of uncoordinated CR networks that employ orthogonal frequency division multiple access (OFDMA) in the uplink. We frame the self-coexistence problem as a non-cooperative game, and propose an uplink soft frequency reuse (USFR) technique to enable globally power-efficient and locally fair sharing of white-space spectrum. In each network, uplink resource allocation is decoupled into two subproblems: subchannel allocation (SCA) and transmit power control (TPC). We provide a unique optimal solution to the TPC subproblem, and present a low-complexity heuristic for the SCA subproblem. Furthermore, we frame the TPC and SCA games, and integrate them as a heuristic algorithm that achieves the Nash equilibrium in a fully distributed manner. Our simulation results show that the proposed USFR technique significantly improves self-coexistence in several aspects, including spectrum utilization, power consumption, and intra-cell fairness.}, 
keywords={Nash equilibrium;OFDMA;cochannel self-coexistence;including spectrum utilization;intracell fairness;locally fair sharing;low complexity heuristic;noncooperative game;orthogonal frequency division multiple access;subchannel allocation;transmit power control;uncoordinated cognitive radio networks;uplink resource allocation;uplink soft frequency reuse;white space spectrum;OFDM modulation;cellular radio;cognitive radio;frequency allocation;frequency division multiple access;game theory;}, 
doi={10.1109/INFCOM.2012.6195525}, 
ISSN={0743-166X},
notes={
vedio: http://vimeo.com/37537942
1. uplink power and channel allocation
2. non-cooperative game, cell is players
3. obj, minimiuze power consumption
4. reach Nash E (audience: NE is not a necessary condition for fairness! in Whitecat we get it by minimizing the sum of inversed values!)

1. formulates the 
}

}

@INPROCEEDINGS{Johnson96dynamicsource,
    author = {David B. Johnson and David A. Maltz},
    title = {Dynamic source routing in ad hoc wireless networks},
    booktitle = {Mobile Computing},
    year = {1996},
    pages = {153--181},
    notes={two mechanisms: route discovery and route maintenance;
    all aspects of the protocol work entirely with on-demand style.
    },
    publisher = {Kluwer Academic Publishers}
}

@INPROCEEDINGS{ICC_Vamsi_2010, 
author={Tumuluru, V.K. and Ping Wang and Niyato, D.}, 
booktitle={Communications (ICC), 2010 IEEE International Conference on}, title={A Neural Network Based Spectrum Prediction Scheme for Cognitive Radio}, 
year={2010}, 
month={may}, 
volume={}, 
number={}, 
pages={1 -5}, 
abstract={The Cognitive Radio (CR) technology enables the unlicensed users to share the spectrum with the licensed users on a non-interfering basis. Spectrum sensing is an important function for the unlicensed users to determine availability of a channel in the licensed user's spectrum. However, spectrum sensing consumes considerable energy which can be reduced by employing predictive methods for discovering spectrum holes. Using a reliable prediction scheme, the unlicensed users will sense only those channels which are predicted to be idle. By achieving a low probability of error in predicting the idle channels, the spectrum utilization can also be improved. Since the traffic characteristics of most licensed user systems encountered in real life are not known a priori, we design the spectrum predictor using the neural network model, multilayer perceptron (MLP), which does not require a prior knowledge of the traffic characteristics of the licensed user systems. The performance of the spectrum predictor is analyzed through extensive simulations.}, 
keywords={CR technology;MLP neural network model;cognitive radio;error probability;licensed user spectrum;multilayer perceptron neural network model;neural network-based spectrum prediction scheme;predictive methods;spectrum sensing;spectrum utilization;cognitive radio;error statistics;multilayer perceptrons;telecommunication computing;}, 
doi={10.1109/ICC.2010.5502348}, 
ISSN={1550-3607},}

@INPROCEEDINGS{Zhou_learningGame_GLOBECOM2010, 
author={Pan Zhou and Yusun Chang and Copeland, J.A.}, 
booktitle={Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE}, title={Learning through Reinforcement for Repeated Power Control Game in Cognitive Radio Networks}, 
year={2010}, 
month={dec.}, 
volume={}, 
number={}, 
pages={1 -6}, 
abstract={This paper studies the repeated power control game in cognitive radio (CR) networks through reinforcement learning without channel and power strategy information exchange among CR users. Unlike traditional game-theoretical approaches on CR power control, this research solves the incomplete information power control problems for selfish and autonomous CR users for the first time. Each CR user in the problem only knows its own channel and power strategy while the information of primary users (PUs) and other different types of CR users are unknown. The formulated power control problem is a constrained repeated stochastic game with learning automaton. The objective of this repeated game is to maximize the average utility of each CR user under the interference power constraints of PUs. At each time step, the CR user only knows its own utility and the interference functions after the play but no further information. This power control game is proved to be asymptotically equivalent to the traditional game theory approaches. The properties of existence, diagonal concavity and uniqueness for this game are illustrated in detail. A Bush-Mosteller reinforcement learning procedure is designed for the power control algorithm. Finally, the learning based power control algorithm is implemented, and the simulation results with detailed analysis are shown to enforce the effectiveness of the proposed algorithms.}, 
keywords={Bush-Mosteller reinforcement learning;cognitive radio networks;interference power constraints;learning automaton;power strategy information exchange;repeated power control game;repeated stochastic game;cognitive radio;game theory;learning (artificial intelligence);power control;telecommunication control;}, 
doi={10.1109/GLOCOM.2010.5684316}, 
ISSN={1930-529X},}

@INPROCEEDINGS{Markov_multiAgentLearning_2010, 
author={Jiandong Li and Chungang Yang}, 
booktitle={Wireless Communications and Signal Processing (WCSP), 2010 International Conference on}, 
title={A Markovian game-theoretical power control approach in cognitive radio networks: A multi-agent learning perspective}, 
year={2010}, 
month={oct.}, 
volume={}, 
number={}, 
pages={1 -5}, 
abstract={Due to the lack of learning and adaptation abilities in traditional game models, e.g., the strategic Nash game, they can't describe the dynamic behaviors and strategy interactive selections well in the cognitive context. The Markov game theoretical modeling approach is investigated to deal with the power control in the cognitive radio (CR) context, which well captures the learning and adaptation abilities of CRs. With the complex interaction relationship of multiple secondary users (SUs), multiple primary users (PUs) with wireless coexistent environment into consideration, both the secondary overall utility maximization and fairness among the SUs are considered from the mathematical model formulation and the algorithm design perspective. A power control approach to searching for the fair and optimal Nash equilibrium solution (NES) based on the improved multi-agent Q-learning is proposed. Meanwhile, the parameters of the presented algorithm are analyzed through simulations. The numerical results confirm that the proposed algorithm can improve the system utility and also guarantee the fairness among the SUs well.}, 
keywords={Markovian game-theoretical power control;Nash equilibrium solution;cognitive radio networks;multi-agent Q-learning;multi-agent learning;primary users;Markov processes;cognitive radio;game theory;multi-agent systems;radio networks;}, 
doi={10.1109/WCSP.2010.5633449}, 
ISSN={},}

@ARTICLE{channelSensingOrder11jasc, 
author={Ho Ting Cheng and Weihua Zhuang}, 
journal={Selected Areas in Communications, IEEE Journal on}, title={Simple Channel Sensing Order in Cognitive Radio Networks}, 
year={2011}, 
month={april }, 
volume={29}, 
number={4}, 
pages={676 -688}, 
abstract={In cognitive radio networks (CRNs), effective and efficient channel exploitation is imperative for unlicensed secondary users to seize available network resources and improve resource utilization. In this paper, we propose a simple channel sensing order for secondary users in multi-channel CRNs without a priori knowledge of primary user activities. By sensing the channels according to the descending order of their achievable rates with optimal stopping, we show that the proposed channel exploitation approach is efficient yet effective in elevating throughput and resource utilization. Simulation results show that our proposed channel exploitation approach outperforms its counterparts by up to 18% in a single-secondary user pair scenario. In addition, we investigate the probability of packet transmission collision in a multi-secondary user pair scenario, and show that the probability of collision decreases as the number of channels increases and/or the number of secondary user pairs decreases. It is observed that the total throughput and resource utilization increase with the number of secondary user pairs due to increased transmission opportunities and multi-user diversity. Our results also demonstrate that resource utilization can be further improved via the proposed channel exploitation approach when the number of secondary user pairs approaches the number of channels.}, 
keywords={cognitive radio network;multiuser diversity;probability of packet transmission collision;resource utilization;unlicensed secondary user;cognitive radio;radio networks;}, 
doi={10.1109/JSAC.2011.110402}, 
ISSN={0733-8716},}


@ARTICLE{pathselection2012TMC, 
commets={},
author={Pan, M. and Yue, H. and Zhang, C. and Fang, Y.}, 
journal={Mobile Computing, IEEE Transactions on}, title={Path Selection under Budget Constraints in Multi-hop Cognitive Radio Networks}, 
year={2012}, 
month={ }, 
volume={PP}, 
number={99}, 
pages={1}, 
abstract={Cognitive Radio (CR) technology opens the licensed spectrum bands for opportunistic usage and initiates spectrum trading to improve the spectrum utilization. In this paper, we investigate the path selection problem in multi-hop cognitive radio networks (CRNs) under constraints on flow routing, link scheduling and CR source's budget. We extend the per-user based spectrum trading in prior work to CR session-based spectrum trading, and effectively develop the spectrum trading mechanisms based on the cross-layer optimization in multi-hop CRNs. We introduce a new service provider, called emph{secondary service provider} (SSP), to help CR sessions to select the paths for packet delivery. Considering the price of bands and the potential returning of primary services at different CR links, the SSP purchases the licensed spectrum and jointly conducts flow routing and link scheduling under the budget constraints. We also propose a 4-dimensional conflict graph to characterize the conflict relationship among CR links and mathematically formulate the path selection problem under multiple constraints into an optimization problem with the objective of maximizing the end-to-end throughput. Due to the NP-hardness of the problem, we have also developed a heuristic algorithm to find the approximate solution.}, 
keywords={}, 
doi={10.1109/TMC.2012.85}, 
ISSN={1536-1233},}

@ARTICLE{OPERA_optimalRoutingTWC2012,
author={Caleffi, Marcello and Akyildiz, Ian F. and Paura, Luigi}, 
journal={Wireless Communications, IEEE Transactions on}, 
title={OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks}, 
year={2012}, 
month={august }, 
volume={11}, 
number={8}, 
pages={2884 -2894}, 
abstract={Two main issues affect the existing routing metrics for cognitive radio ad hoc networks: i) they are often based on heuristics, and thus they have not been proved to be optimal; ii) they do not account for the route diversity effects, and thus they are not able to measure the actual cost of a route. In this paper, an optimal routing metric for cognitive radio ad hoc networks, referred to as OPERA, is proposed. OPERA is designed to achieve two features: i) Optimality: OPERA is optimal when combined with both Dijkstra and Bellman-Ford based routing protocols; ii) Accuracy: OPERA exploits the route diversity provided by the intermediate nodes to measure the actual end-to-end delay, by taking explicitly into account the unique characteristics of cognitive radio networks. A closed-form expression of the proposed routing metric is analytically derived for both static and mobile networks, and its optimality is proved rigorously. Performance evaluation is conducted through simulations, and the results reveal the benefits of adopting the proposed routing metric for cognitive radio ad hoc networks.}, 
keywords={}, 
doi={10.1109/TWC.2012.061912.111479}, 
ISSN={1536-1276},}

@INPROCEEDINGS{reinforcementLearning2009, 
author={Bing Xia and Wahab, M.H. and Yang Yang and Zhong Fan and Sooriyabandara, M.}, 
booktitle={Cognitive Radio Oriented Wireless Networks and Communications, 2009. CROWNCOM '09. 4th International Conference on}, title={Reinforcement learning based spectrum-aware routing in multi-hop cognitive radio networks}, 
year={2009}, 
month={june}, 
volume={}, 
number={}, 
pages={1 -5}, 
abstract={Routing in multi-hop cognitive radio networks (CRN) should be spectrum-aware. In this paper, two adaptive reinforcement learning based spectrum-aware routing protocols are introduced. Q-learning and dual reinforcement learning are applied respectively for them. The cognitive nodes store a table of Q values that estimate the numbers of available channels on the routes and update them while routing. So they can adaptively learn good routes which have more available channels from just local information. Compared to the previous spectrum aware routing protocols in multi-hop cognitive radio networks, they are simpler and easier to implement, more cost-effective, and can avoid drawbacks in on-demand protocols but still keep adaptive and dynamic routing. Both of our protocols perform better than the spectrum-aware shortest path protocol when network load is not too low. In the meantime, spectrum-aware DRQ-routing learns the optimal routing policy 1.5 times as fast as the spectrum-aware Q-routing at low and medium network load. It also learns a routing policy which is more than seven times as good as that of spectrum-aware Q-routing at high network load.}, 
keywords={Q-learning;dynamic routing;multihop cognitive radio network;network load;on-demand protocol;reinforcement learning based spectrum-aware routing protocol;shortest path protocol;wireless channel;cognitive radio;frequency allocation;learning (artificial intelligence);routing protocols;telecommunication computing;wireless channels;}, 
doi={10.1109/CROWNCOM.2009.5189189}, 
ISSN={},}

@INPROCEEDINGS{geoTVprotection08dyspan, 
author={Gurney, D. and Buchwald, G. and Ecklund, L. and Kuffner, S.L. and Grosspietsch, J.}, 
booktitle={Proc. of IEEE DySPAN 2008}, 
title={Geo-Location Database Techniques for Incumbent Protection in the {TV} White Space}, 
year={2008}, 
month={Oct.}, 
volume={}, 
number={}, 
//pages={1 -9}, 
abstract={The opening of the television bands in the United States presents an exciting opportunity for secondary spectrum utilization. Protecting licensed broadcast television viewers from harmful interference due to secondary spectrum usage is critical to the successful deployment of TV white space devices. A wide variety of secondary system operating scenarios must be considered in any potential interference analysis, as described below. Several different types of licensed television transmitters currently exist in the TV bands, along with secondary licensed services, such as wireless microphones. All licensed services must be adequately protected from harmful interference, which can readily and reliably be achieved with the described geo-location database methods. Specific implementation details of geo-location databases are discussed, including several complexity reduction techniques. Geo-location database techniques are also shown to more efficiently utilize available spectrum than other spectrum access techniques.}, 
keywords={TV white space device;geo-location database technique;incumbent system protection;licensed broadcast television;licensed television transmitter;potential interference analysis;secondary spectrum utilization;television band;television broadcasting;television interference;television transmitters;}, 
doi={10.1109/DYSPAN.2008.31}, 
ISSN={},}

@INPROCEEDINGS{multicell_geo_dyspan11, 
level = {A},
notes={
WhiteNet:
1. Modify the database from the FCC regulation, which contains location information of TV and other APs, and the available channels can be used, the transmission power is fixed.
2, Interfernce among APs and non-uniform, because the path loss is dependent on the center frequency of TV band, a distributed schme is proposed among APs.
3, A distributed scheme is proposed to assign TV spectrum. Each AP accesses acquires a small number of spectrum, and then improve its spectrum occupation with minor adjust on its spectrum sequencially. The authors consider the restriction of spectrum width spported on APs, so that each AP utilizes a chunk of slices of spectrum.
},
author={Xiaojun Feng and Jin Zhang and Qian Zhang}, 
booktitle={Proc. of IEEE DySPAN 2011}, 
title={Database-assisted multi-{AP} network on {TV} white spaces: Architecture, spectrum allocation and AP discovery}, 
year={2011}, 
month={may}, 
volume={}, 
number={}, 
pages={265 -276}, 
abstract={According to the FCC's final rule for the unlicensed use of TV white spaces, secondary users are required to query a geo-location database to determine whether a spectrum band is occupied or not. However, how to design a multi-cell infrastructure-based secondary network to dynamically access TV white spaces with the help of database is still an open issue. In this paper, we present the design and implementation of WhiteNet, a multi-cell infrastructure-based dynamic spectrum access system on TV white spaces. WhiteNet is compatible with the FCC's database architecture. In WhiteNet, the geo-location database is exploited to assist multi-AP coordination. A low-overhead distributed spectrum allocation algorithm is proposed to allocate spectrum among multiple APs in WhiteNet, considering the heterogeneous propagation property among various spectrum bands throughout TV white spaces. A novel AP discovery scheme is designed to enable users to discover and select the best access point to connect. We implement WhiteNet in a 7-node GNU Radio testbed, which demonstrates the feasibility of our system. Evaluation results show that our spectrum allocation algorithm can significantly increase total network throughput, besides, the AP discovery scheme is reliable and efficient.}, 
keywords={AP discovery;GNU Radio testbed;TV white spaces;WhiteNet;access points;database-assisted multi-AP network;dynamic spectrum access system;geo-location database;heterogeneous propagation property;low-overhead distributed spectrum allocation;multicell infrastructure-based secondary network;secondary users;radio spectrum management;television broadcasting;}, 
doi={10.1109/DYSPAN.2011.5936215}, 
ISSN={},}

@inproceedings{dsaWhitespace09mobicom,
 author = {Deb, Supratim and Srinivasan, Vikram and Maheshwari, Ritesh},
 title = {Dynamic spectrum access in DTV whitespaces: design rules, architecture and algorithms},
 booktitle = {Proceedings of the 15th annual international conference on Mobile computing and networking},
 series = {MobiCom '09},
 year = {2009},
 isbn = {978-1-60558-702-8},
 location = {Beijing, China},
 pages = {1--12},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/1614320.1614322},
 doi = {10.1145/1614320.1614322},
 acmid = {1614322},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {DTV white space, dynamic spectrum, enterprize wireless lan},
}


@InProceedings{Liang_2007,
  author    = {Y. Liang and Y. Zeng and E. Peh and A. Hoang},
  title        = {{Sensing-Throughput Tradeoff of Cognitive Radio Networks}},
  booktitle    = {Proc. of the IEEE {International Conference on Communications} {(ICC)}},
  year        = {2007},
  month        = jun,
  address    = {Glasgow, Great Britain},
  keywords = {Cognitive radio, sensing accuracy, secondary network throughput},
  abstract = {This paper investigates the dependency of sensing accuracy on the throughput of seonsdary networks. A model for sensing under hypothesis is given and for a sensing threshold the respective probability of detection and false alarm are derived. Then a throughput model is formed that depends on these two quantities. For a given detection probability, the objective is then to maximize the throughput subject to the variable length of the sensing period. A longer sensing period yields a lower probability of false alarm but less time remaining for the data transmission and vice versa. The paper proves for energy detection the existence of an optimal sensing period but does not state a formula for it. Numerically, the authors show for the case of 802.22 and the FCC sensing requirements (P_d = 0.9 at SNR = - 15 dB) that the longer the sensing takes, the lower is the probability of false alarm. Furthermore, there is indeed the an optimal sensign period while the optimal sensing period is also dependent on the number of terminals in the cell (the larger the terminals, the lower is the sensing period), which leads to a higher capacity.},
  quality  = {B}
}



@InProceedings{Temperature_regulation03,
  author    = {{Federal Communications Commission}},
  title        = {{Establishment of an InterferenceTemperature Metric to Quantify and Manage Interference and to ExpandAvailable Unlicensed Operation in Certain Fixed, Mobile and SatelliteFrequency}},
  booktitle    = {ET Docket, no.03-237},
  year        = {2003},
  month        = Nov.,

  keywords = {},
  abstract = {},
  quality  = {}
}

@INPROCEEDINGS{09wiopt_delay_routing, 
author={Stamatiou, K. and Rossetto, F. and Haenggi, M. and Javidi, T. and Zeidler, J.R. and Zorzi, M.}, 
booktitle={Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2009. WiOPT 2009. 7th International Symposium on}, 
title={A delay-minimizing routing strategy for wireless multi-hop networks}, 
year={2009}, 
month={june}, 
volume={}, 
number={}, 
pages={1 -6}, 
abstract={We consider a network where each route comprises a backlogged source, a number of relays and a destination at a finite distance. The locations of the sources and the relays are realizations of independent Poisson point processes. Given that the nodes observe a TDMA/ALOHA MAC protocol, our objective is to determine the number of relays and their placement such that the mean end-to-end delay in a typical route of the network is minimized. We first study an idealistic network model where all routes have the same number of hops, the same distance per hop and their own dedicated relays. Combining tools from queueing theory and stochastic geometry, we provide a precise characterization of the mean end-to-end delay. We find that the delay is minimized if the first hop is much longer than the remaining hops and that the optimal number of hops scales sublinearly with the source-destination distance. Simulating the original network scenario reveals that the analytical results are accurate, provided that the density of the relay process is sufficiently large. We conclude that, given the considered MAC protocol, our analysis provides a delay-minimizing routing strategy for random, multihop networks involving a small number of hops.}, 
keywords={TDMA/ALOHA MAC protocol;delay-minimizing routing strategy;independent Poisson point processes;mean end-to-end delay;queueing theory;random networks;source-destination distance;stochastic geometry;wireless multihop networks;access protocols;delays;queueing theory;radio networks;telecommunication network routing;time division multiple access;}, 
doi={10.1109/WIOPT.2009.5291567}, 
ISSN={},}


@INPROCEEDINGS{DySpAN10MeasuringWhitespaceCapacity, 
author={Harrison, K. and Mishra, S.M. and Sahai, A.}, 
booktitle={Proc. of DySPAN 2010}, 
title={How Much White-Space Capacity Is There?}, 
notes={analyzes the capacity can be possibly provided by white TV space. Complying with the rigid regulation of FCC, TV white space brings hundreds of kilobits/sec per square kilometer for secondary users when the communicating secondary pair are 1 KM apart. It also shows the interference among secondary users heavily restricts the capacity.},
year={2010}, 
month={Apr.}, 
volume={}, 
number={}, 
pages={1 -10}, 
abstract={The November 2008 FCC ruling allowing access to the television white-spaces prompts a natural question. What is the magnitude and geographic distribution of the opportunity that has been opened up? This paper takes a semi-empirical perspective and uses the FCC's database of television transmitters, USA census data from 2000, and standard wireless propagation and information-theoretic capacity models to see the distribution of data-rates available on a per-person basis for wireless Internet access across the continental USA. To get a realistic evaluation of the potential public benefit, we need to examine more than just how many white-space channels have been made available. It is also important to consider the impact of wireless "pollution" from existing television stations, the self-interference among white-space devices themselves, the population distribution, and the expected transmission range of the white-space devices. The clear advantage of the white-space approach is revealed through a direct comparison of the Pareto frontier of the new white-space approach and that corresponding to the traditional approach of refarming bands between television and wireless data service. Finally, the critical importance of economic investment considerations is shown by considering the status of rural versus urban areas. Based on technical considerations alone, whether we consider long- or short-range white-space systems, people in rural areas would seem to be the main beneficiaries of white-space systems. A power-law distribution even appears that suggests that many rural customers could enjoy tremendous data-rates. However, the fundamental need to recover investments by wireless ISPs couples the range inversely to the population density. This clips the tail of the power-law and shows that urban and suburban areas can actually get significant benefit from the TV white-spaces. Overall, the opportunity provided by TV white-spaces is shown to be potentially of the same order a- - s the recent release of "beachfront" 700MHz spectrum for wireless data service.}, 
keywords={FCC;economic investment;power law distribution;semi empirical perspective;television transmitter database;television white space;white space capacity;wireless ISP;wireless data service;wireless pollution;Internet;investment;radio spectrum management;television broadcasting;television transmitters;}, 
doi={10.1109/DYSPAN.2010.5457914}, 
ISSN={},}

@ARTICLE{tvgreyspace12, 
author={Bezabih, H. and Ellingsaeter, B. and Noll, J. and Maseng, T.}, 
journal={IEEE Vehicular Technology Magazine}, 
title={Digital Broadcasting: Increasing the Available White Space Spectrum Using {TV} Receiver Information}, 
year={2012}, 
month={march }, 
volume={7}, 
number={1}, 
pages={24 -30}, 
abstract={This paper discusses the increase in available white space spectrum using TV receiver information. TV receivers can increase the amount of available spectrum for cognitive radio devices in the TV bands by as much as 120 MHz.}, 
keywords={TV receiver information;TV white spaces;cognitive radio;digital broadcasting;frequency 120 MHz;television receivers;white space spectrum;cognitive radio;television broadcasting;television receivers;}, 
doi={10.1109/MVT.2011.2179344}, 
ISSN={1556-6072},}

@INPROCEEDINGS{DySpAN12_Di, 
author={Li,D. and Gross,J.}, 
booktitle={Proc. of IEEE DySPAN 2012}, 
title={Distributed {TV} Spectrum Allocation for Cognitive Cellular Network under Game Theoretical Framework}, 
%year={2012}, 
month={Otc.}, 
volume={}, 
number={}, 
}




@INPROCEEDINGS{gpsfree05infocom, 
author={Caruso, A. and Chessa, S. and De, S. and Urpi, A.}, 
booktitle={Proc. IEEE INFOCOM '05}, 
title={{GPS} free coordinate assignment and routing in wireless sensor networks}, 
//year={2005}, 
month={march}, 
volume={1}, 
number={}, 
pages={ 150 - 160 vol. 1}, 
notes={
1. the scheme is composed with 4 steps, flooding in each step.
2. The assignment of virtual coordinates to all nodes are initialized by the destination node
3. prove that nodes with the same virtual coordinates locate not far away physically.
},
abstract={ In this paper we consider the problem of constructing a coordinate system in a sensor network where location information is not available. To this purpose we introduce the virtual coordinate assignment protocol (VCap) which defines a virtual coordinate system based on hop distances. As compared to other approaches, VCap is simple and have very little requirements in terms of communication and memory overheads. We compare by simulations the performances of greedy routing using our virtual coordinate system with the one using the physical coordinates. Results show that the virtual coordinate system can be used to efficiently support geographic routing.}, 
keywords={ GPS free coordinate assignment; geographic routing; greedy routing; virtual coordinate assignment protocol; virtual coordinate system; wireless sensor networks; greedy algorithms; radionavigation; routing protocols; wireless sensor networks;}, 
doi={10.1109/INFCOM.2005.1497887}, 
ISSN={0743-166X},}

@INPROCEEDINGS{self-coexistenceWRAN2010infocom, 
author={Gardellin, V. and Das, S.K. and Lenzini, L.}, 
booktitle={Proc. of IEEE INFOCOM, Computer Communications Workshops}, 
title={A Fully Distributed Game Theoretic Approach to Guarantee Self-Coexistence among WRANs}, 
year={2010}, 
month={march}, 
volume={}, 
number={}, 
pages={1 -6}, 
abstract={Although the proliferation of wireless applications operating in unlicensed spectrum bands has resulted in overcrowding, recent analysis has shown that license bands are still underutilized. Cognitive Radio is seen as the key enabling technology to address the spectrum shortage problem, opportunistically using the spectrum allocated for TV bands. In this paper, we present a novel game theoretic framework that uses the potentialities of the new IEEE 802.22 Standard to guarantee self-coexistence among Wireless Regional Area Networks. We address this problem as a channel assignment problem where each WRAN acquires a chunk of spectrum free of interference in a dynamic and distributed way. Using a novel technique to compute backoff windows, we show that the channel assignment problem can be formulated as a multi-player non-cooperative repeated potential game that converges to a Nash Equilibrium point. We consider each WRAN as a player of our game and we use two different types of utility functions to maximize the spatial reuse and minimize the interference. An extensive simulation study shows that having the interference minimization as objective is not necessarily the best solution with selfish players.}, 
keywords={IEEE 802.22 standard;Nash equilibrium point;TV bands;backoff windows;channel assignment problem;cognitive radio;distributed game theoretic approach;interference minimization;multiplayer noncooperative repeated potential game;spectrum shortage problem;unlicensed spectrum bands;utility function;wireless application;wireless regional area networks;IEEE standards;channel allocation;cognitive radio;game theory;interference;radio spectrum management;wireless channels;}, 
doi={10.1109/INFCOMW.2010.5466713}, 
ISSN={},}

@INPROCEEDINGS{802.22game_08globecom, 
author={Sengupta, S. and Chandramouli, R. and Brahma, S. and Chatterjee, M.}, 
booktitle={Proc. of IEEE GLOBECOM 2008}, 
title={A Game Theoretic Framework for Distributed Self-Coexistence Among {IEEE} 802.22 Networks}, 
year={2008}, 
month={30 2008-dec. 4}, 
volume={}, 
number={}, 
pages={1 -6}, 
abstract={The cognitive radio based IEEE 802.22 wireless regional area network (WRAN) is designed to operate in the under-utilized TV bands by detecting and avoiding primary TV transmission bands in a timely manner. Such networks, deployed by competing wireless service providers, would have to self-coexist by accessing different parts of the available spectrum in a distributed manner. Obviously, the goal of every network is to acquire a clear spectrum chunk free of interference from other IEEE 802.22 networks so as to satisfy the QoS of the services delivered to the end-users. In this paper, we study the distributed WRAN self-coexistence problem from a minority game theoretic perspective. We model the spectrum band switching game where the networks try to minimize their cost in finding a clear band. We propose a mixed strategy that the competing networks must adhere to in order to achieve the Nash equilibrium. Simulation experiments have also been conducted and results corroborate with the theoretical analysis.}, 
keywords={IEEE 802.22 wireless regional area network;Nash equilibrium;TV bands;cognitive radio;distributed WRAN self-coexistence;game theory;spectrum band switching game;cognitive radio;game theory;metropolitan area networks;wireless LAN;}, 
doi={10.1109/GLOCOM.2008.ECP.598}, 
notes ={Energy-Efficient Spectrum Sharing and Power Allocation in Cognitive Radio Femtocell Networks

Relay-assisted Routing in Cognitive Radio Networks

Optimal Bandwidth Allocation with Dynamic Service Selection in Heterogeneous Wireless Networks}
ISSN={1930-529X},}





@INPROCEEDINGS{Discrete-Time_Spectrum_Occupancy_Model_DySPAN_2011, 
author={Lopez-Benitez, M. and Casadevall, F.}, 
booktitle={Proc. of 2011 IEEE DySPAN}, 
title={Discrete-time spectrum occupancy model based on Markov Chain and duty cycle models}, 
//booktitle={Proc. of 2011 IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN)}, 
//year={2011}, 
//month={may}, 
//volume={}, 
//number={}, 
//pages={90 -99}, 
abstract={This paper presents an empirical time-dimension model of spectrum use in the context of dynamic spectrum access. Concretely, a discrete-time two-state Markov chain with novel duty cycle models is proposed as an adequate mean to accurately describe spectrum occupancy in the time domain. The validity and accuracy of the proposed model is assessed and corroborated with extensive empirical data from a multi-band spectrum measurement campaign. The obtained results demonstrate that the proposed approach is able to capture and reproduce with significant accuracy the statistical properties of spectrum use observed in real channels of various technologies.}, 
keywords={Accuracy;Antenna measurements;Channel models;Context modeling;Load modeling;Markov processes;Mathematical model;Markov processes;cognitive radio;time-domain analysis;cognitive radio;discrete-time spectrum occupancy model;discrete-time two-state Markov chain;duty cycle models;empirical time-dimension model;multiband spectrum measurement campaign;time domain;}, 
doi={10.1109/DYSPAN.2011.5936273}, 
ISSN={},
notes={}
}

@INPROCEEDINGS{learning_optimization_markov_SECON2012, 
author={Yi Gai and Krishnamachari, B. and Mingyan Liu}, 
booktitle={Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2012 9th Annual IEEE Communications Society Conference on}, title={Online learning for combinatorial network optimization with restless Markovian rewards}, 
year={2012}, 
month={june}, 
volume={}, 
number={}, 
pages={28 -36}, 
abstract={Combinatorial network optimization algorithms that compute optimal structures taking into account edge weights form the foundation for many network protocols. Examples include shortest path routing, minimal spanning tree computation, maximum weighted matching on bipartite graphs, etc. We present CLRMR, the first online learning algorithm that efficiently solves the stochastic version of these problems where the underlying edge weights vary as independent Markov chains with unknown dynamics. The performance of an online learning algorithm is characterized in terms of regret, defined as the cumulative difference in rewards between a suitably-defined genie, and that obtained by the given algorithm. We prove that, compared to a genie that knows the Markov transition matrices and uses the single-best structure at all times, CLRMR yields regret that is polynomial in the number of edges and nearly-logarithmic in time.}, 
keywords={Heuristic algorithms;Indexes;Markov processes;Optimization;Polynomials;Upper bound;Vectors;Markov processes;graph theory;learning (artificial intelligence);optimisation;CLRMR;Markov transition matrices;bipartite graphs;combinatorial network optimization algorithm;cumulative difference;independent Markov chains;maximum weighted matching;minimal spanning tree computation;nearly logarithmic;network protocols;online learning algorithm;optimal structures;restless Markovian rewards;shortest path routing;single best structure;stochastic version;suitably defined genie;underlying edge weight;unknown dynamics;}, 
doi={10.1109/SECON.2012.6275789}, 
ISSN={2155-5486},}

@ARTICLE{bandwidthAllocation2012tmc, 
author={Xu, D. and Jung, E. and Liu, X.}, 
journal={Mobile Computing, IEEE Transactions on}, title={Efficient and Fair Bandwidth Allocation in Multichannel Cognitive Radio Networks}, 
year={2012}, 
month={aug. }, 
volume={11}, 
number={8}, 
pages={1372 -1385}, 
abstract={Cognitive radio (CR) improves spectrum efficiency by allowing secondary users (SUs) to dynamically exploit the idle spectrum owned by primary users (PUs). This paper studies optimal bandwidth allocation of SUs for throughput efficiency. Consider the following tradeoff: an SU increases its instantaneous throughput by accessing more spectrum, but channel access/switching overhead, contention among multiple SUs, and dynamic PU activity create higher liability for larger bandwidths. So how much is too much? In this paper, we study the optimal bandwidth allocation for multiple SUs. Our approach is twofold. We first study the optimal bandwidth an SU should use to maximize the per-SU throughput in the long term. The optimal bandwidth is derived in the context of dynamic PU activity, where we consider both independent and correlated PU channel scenarios while accounting for the effects of channel switching overhead. We further consider the case of suboptimal spectrum use by SUs in the short term due to PU activity dynamics. We propose an efficient channel reconfiguration (CREC) scheme to improve SUs' performance. We use real PU channel activity traces in the simulations to validate our results. The work sheds light on the design of spectrum sharing protocols in cognitive radio networks.}, 
keywords={Bandwidth;Channel allocation;Cognitive radio;Radio spectrum management;Throughput;Cognitive radio;bandwidth allocation;channel correlation.;opportunistic spectrum access;}, 
doi={10.1109/TMC.2011.168}, 
ISSN={1536-1233},

}

@INPROCEEDINGS{OSA2011infocom_channelModel, 
author={Min, A.W. and Kyu-Han Kim and Singh, J.P. and Shin, K.G.}, 
booktitle={INFOCOM, 2011 Proceedings IEEE}, title={Opportunistic spectrum access for mobile cognitive radios}, 
year={2011}, 
month={april}, 
volume={}, 
number={}, 
pages={2993 -3001}, 
keywords={Availability;Exponential distribution;Interference;Markov processes;Mobile communication;Sensors;Transmitters;Markov processes;cognitive radio;mobile radio;continuous-time Markov chain;distributed channel access;licensed spectrum bands;mobile cognitive radios;opportunistic spectrum access;spectrum scarcity problem;}, 
doi={10.1109/INFCOM.2011.5935141}, 
ISSN={0743-166X},}

@inproceedings{proactive-phycom07,
    author = {Yang, Lei and Cao, Lili and Zheng, Haitao},
    booktitle = {Proc. of the Second International Conference on Cognitive Radio Oriented Wireless Networks and Communications},
    citeulike-article-id = {2307817},
    keywords = {bibtex-import},
    pdf = {C:\\Research\\Desktopbiblio\\YCZ07.pdf},
    posted-at = {2008-01-30 16:03:38},
    priority = {0},
    title = {{Proactive Channel Access in Dynamic Spectrum Networks}},
    year = {2007}
}


@TechReport{Adaptive_MAClayer_sensing_06,
author = {Hyoil Kim and Kang G. Shin},
title = {Adaptive MAC-layer Sensing of Spectrum Availability in Cognitive Radio Networks},
institution = { University of Michigan},
year = {2006},
OPTkey = {key},
OPTtype = {type},
OPTnumber = {CSE-TR-518-06},
OPTaddress = {address},
OPTmonth = {month},
OPTnote = {note},
OPTannote = {annote},
}

@INPROCEEDINGS{5684321, 
author={Brahma, S. and Chatterjee, M.}, 
booktitle={Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE}, title={A Bargaining Game for Channel Access in Dynamic Spectrum Access Networks}, 
year={2010}, 
month={dec.}, 
volume={}, 
number={}, 
pages={1 -6}, 
abstract={In this paper, we model the problem of dynamic spectrum access by a set of cognitive radio enabled nodes as an infinite horizon bargaining game. Each node (or, player) negotiates with its interfering nodes to obtain an agreeable sharing rule of the available channels. We investigate the subgame perfect equilibrium strategies of the bargaining game, abiding by which, each node can maximize its throughput against all its interfering nodes (opponents). We further study the issue of fairness in this model, in terms of the relative number of channels allocated to the nodes. Moreover, each node bargains with its interfering neighbors independently and in a distributed manner, making the system scalable.},
keywords={Equations;Games;IEEE Communications Society;Mathematical model;Peer to peer computing;Resource management;Throughput;cognitive radio;game theory;channel access;cognitive radio enabled nodes;dynamic spectrum access networks;infinite horizon bargaining game;interfering nodes;subgame perfect equilibrium strategies;},
doi={10.1109/GLOCOM.2010.5684321},
ISSN={1930-529X},}

@INPROCEEDINGS{6213986,
author={Brahma, S. and Chatterjee, M.},
booktitle={Wireless Communications and Networking Conference (WCNC), 2012 IEEE}, title={Spectrum sharing in secondary networks: A bargain theoretic approach},
year={2012},
month={april},
volume={},
number={},
pages={1331 -1336},
abstract={In this paper, we address the problem of dynamic channel access by a set of cognitive radio enabled nodes (e.g., broadcast access points), where each node acting in a selfish manner tries to access and use as many channels as possible, subject to the interference constraints. We model the dynamic channel access problem as a modified Rubinstein-St #x00E5;hl bargaining game. In our model, each node (player) negotiates with the other nodes to obtain an agreeable sharing rule of the available channels, such that, no two interfering nodes use the same channel. We solve the bargaining game by finding Subgame Perfect Nash Equilibrium (SPNE) strategies of the game. First, we consider finite horizon version of the bargaining game and investigate its SPNE strategies. We then extend these results to the infinite horizon bargaining game. Furthermore, we identify Pareto optimal equilibria of the game for improving spectrum utilization. The bargaining solution ensures that no node is starved of channels. We also conduct extensive simulations to study how the #x201C;self-gain #x201D; maximizing strategy of the players impact system wide performance.},
keywords={Cognitive radio;Color;Games;Interference constraints;Pareto optimization;Resource management;cognitive radio;game theory;wireless channels;SPNE strategy;bargain theoretic approach;cognitive radio enabled nodes;dynamic channel access problem;infinite horizon bargaining game;interference constraints;modified Rubinstein-St #x00E5;hl bargaining game;secondary networks;self-gain maximizing strategy;spectrum sharing;spectrum utilization;subgame perfect Nash equilibrium strategy;}, 
doi={10.1109/WCNC.2012.6213986},
ISSN={1525-3511},}

@book{ProbabilityAndComputing,
 author = {Mitzenmacher, Michael and Upfal, Eli},
 title = {Probability and Computing: Randomized Algorithms and Probabilistic Analysis},
 year = {2005},
 isbn = {0521835402},
 publisher = {Cambridge University Press},
 address = {New York, NY, USA},
}



@article{Ansari:2013:DMP:2527393.2527449,
 author = {Ansari, Junaid and Zhang, Xi and M\"{a}h\"{o}nen, Petri},
 title = {A Decentralized MAC Protocol for Opportunistic Spectrum Access in Cognitive Wireless Networks},
 journal = {Comput. Commun.},
 issue_date = {July, 2013},
 volume = {36},
 number = {13},
 month = jul,
 year = {2013},
 issn = {0140-3664},
 pages = {1399--1410},
 numpages = {12},
 url = {http://dx.doi.org/10.1016/j.comcom.2013.06.001},
 doi = {10.1016/j.comcom.2013.06.001},
 acmid = {2527449},
 publisher = {Elsevier Science Publishers B. V.},
 address = {Amsterdam, The Netherlands, The Netherlands},
 keywords = {Cognitive radios, Decentralized, Experimentation, MAC, SDR testbed},
 {notes=
distributed mac protocol: tr keeps on transmitting a packet until it is received by rc;
multical channel scanning goes on periotically;
assign weights to channels, increase the weight when the channel is detected as free, decrease when it is interferred. maintain a channel maps which are sensed channel characteristics, and exchange them with neighbors.
}
} 



@proceedings{globecom_2011_vn,
  title     = {Intermittently Connected Vehicle-to-Vehicle Networks: Detection and Analysis},
  booktitle     = {Proceedings of the Global Communications Conference, GLOBECOM
               2011, 5-9 December 2011, Houston, Texas, USA},
  notes = {
    			investigate the correlated mobility pattern among vehiculars, which is helpful for data forwarding and clustering in vehicle-to-vehicle networks.
  },
  booktitle = {GLOBECOM},
  publisher = {IEEE},
  year      = {2011},
  isbn      = {978-1-4244-9266-4},
  ee        = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6132211},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@INPROCEEDINGS{Rate_Relay_Selection2012icc, 
author={Mehta, N. and Duel-Hallen, A. and Wenye Wang}, 
booktitle={Communications (ICC), 2012 IEEE International Conference on}, title={Enabling adaptive rate and relay selection for 802.11 mobile ad hoc networks}, 
year={2012}, 
pages={4150-4154}, 
abstract={Mobile ad hoc networks (MANETs) are self-configuring wireless networks that lack permanent infrastructure and are formed among mobile nodes on demand. Rapid node mobility results in dramatic channel variation, or fading, that degrades MANET performance. Employing channel state information (CSI) at the transmitter can improve the throughput of routing and medium access control (MAC) protocols for mobile ad hoc networks. Several routing algorithms in the literature explicitly incorporate the fading signal strength into the routing metric, thus selecting the routes with strong channel conditions. While these studies show that adaptation to the time-variant channel gain is beneficial in MANETs, they do not address the effect of the outdated fading CSI at the transmitter. For realistic mobile node speeds, the channel gain is rapidly varying, and becomes quickly outdated due the feedback delay. We analyze the link throughput of joint rate adaptation and adaptive relay selection in the presence of imperfect CSI. Moreover, for an 802.11 network that employs geographic opportunistic routing with adaptive rate and relay selection, we propose a novel method to reduce the effect of the feedback delay at the MAC layer in the presence of Rayleigh fading. This method exploits channel reciprocity and fading prediction and does not require significant modification to the existing 802.11 frame structure. Extensive network simulations demonstrate that the proposed approach significantly improves the throughput, delay, and packet delivery ratio for high mobile velocities relative to previously proposed approaches that employ outdated CSI at the transmitter.}, 
keywords={Rayleigh channels;access protocols;mobile ad hoc networks;telecommunication network reliability;telecommunication network routing;wireless LAN;802.11 frame structure;CSI;MAC protocols;MANET;Rayleigh fading;adaptive relay selection;channel gain;channel reciprocity;channel state information;fading prediction;fading signal strength;feedback delay;joint rate adaptation;link throughput;medium access control protocols;mobile ad hoc networks;mobile nodes;packet delivery ratio;realistic mobile node speeds;routing throughput;self-configuring wireless networks;time-variant channel gain;Ad hoc networks;Delay;Fading;Relays;Routing;Signal to noise ratio;Throughput}, 
doi={10.1109/ICC.2012.6363785}, 
ISSN={1550-3607},
notes={The Latency of Gaining α-Reliability for Message
Dissemination in Vehicle-to-Vehicle Networks:

  	give a upper bound on the dilivery time of successful transmission given a cetain α-reliability}
}

.
	
@INPROCEEDINGS{rate-relay-selection2006milcom,
author={Souryal, M.R. and Moayeri, N.}, 
notes ={
		joint raley selection (combination of geograhic progress and snr) and rate adaption.
		as the the decrease of snr between snr measurement and data transmission, the authors claim that raley diversity can mitigate this!
},
booktitle={Military Communications Conference, 2006. MILCOM 2006. IEEE}, 
title={Joint Rate Adaptation and Channel-Adaptive Relaying in 802.11 Ad Hoc Networks}, 
year={2006}, 
pages={1-8}, 
abstract={Channel-adaptive relaying hhttp://www.icir.org/bkarp/gpsr/as recently been proposed as a means to exploit spatial and temporal diversity in multihop ad hoc networks with fading. In conjunction with appropriate routing protocols, adaptive relaying enables each forwarding node in a multihop path to dynamically select the next-hop relay as a function of the measured (time-varying) channel state, providing a form of selection diversity at each hop. Based on the notion that links to diversity-selected relays have higher information capacity and therefore can support higher data rates than links obtained with traditional routing, this paper proposes marrying channel-adaptive relaying with rate adaptation (or adaptive modulation-coding). In particular, we specify a protocol for performing joint rate and relay adaptation in 802.11 ad hoc networks with geographic routing. Using both analytical and simulation tools, synergistic gains are observed in throughput, capacity and delay. Performance results are given for individual links as well as for multihop networks, in time-varying, correlated Rayleigh and Ricean fading channels over a range of channel speeds. Of particular interest in this study is the robustness of the adaptation to increasing channel Doppler. As a by-product of this work, we propose a new, SNR-based rate adaptation scheme for use in 802.11 systems that requires no modification to the standard 802.11 frame structure}, 
keywords={Rayleigh channels;Rician channels;ad hoc networks;diversity reception;routing protocols;spatiotemporal phenomena;time-varying channels;wireless LAN;802.11 ad hoc networks;Ricean fading channel;channel Doppler;channel-adaptive relaying;correlated Rayleigh channel;geographic routing protocol;multihop network;rate adaptation;spatial-temporal diversity;time-varying channel;Ad hoc networks;Analytical models;Delay;Fading;Modulation coding;Relays;Robustness;Routing protocols;Spread spectrum communication;Throughput}, 
doi={10.1109/MILCOM.2006.302238},}	


@inproceedings{gpsr_2000mobicom,
 author = {Karp, Brad and Kung, H. T.},
 title = {GPSR: greedy perimeter stateless routing for wireless networks},
booktitle = {Proc. of ACM MobiCom '00},
 //booktitle = {Proceedings of the 6th annual international conference on Mobile computing and networking},
 //series = {MobiCom '00},
 //year = {2000},
 //isbn = {1-58113-197-6},
 //location = {Boston, Massachusetts, USA},
 //pages = {243--254},
 //numpages = {12},
 //url = {http://doi.acm.org/10.1145/345910.345953},
 //doi = {10.1145/345910.345953},
 //acmid = {345953},
 //publisher = {ACM},
 //address = {New York, NY, USA},
 notes={The first graph is very good!
http://www.icir.org/bkarp/gpsr/a}
}




@INPROCEEDINGS{CAR_infocom07, 
author={Naumov, V. and Gross, T.R.}, 
booktitle={INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE}, 
title={Connectivity-Aware Routing (CAR) in Vehicular Ad-hoc Networks}, 
year={2007}, 
pages={1919-1927}, 
abstract={Vehicular ad hoc networks using WLAN technology have recently received considerable attention. We present a position-based routing scheme called Connectivity-Aware Routing (CAR) designed specifically for inter-vehicle communication in a city and/or highway environment. A distinguishing property of CAR is the ability to not only locate positions of destinations but also to find connected paths between source and destination pairs. These paths are auto-adjusted on the fly, without a new discovery process. "Guards" help to track the current position of a destination, even if it traveled a substantial distance from its initially known location. For the evaluation of the CAR protocol we use realistic mobility traces obtained from a microscopic vehicular traffic simulator that is based on a model of driver behavior and the real road maps of Switzerland.}, 
keywords={ad hoc networks;road traffic;road vehicles;routing protocols;wireless LAN;CAR position-based routing scheme;CAR protocol;WLAN technology;connectivity-aware routing protocol;highway environment;inter-vehicle communication;microscopic vehicular traffic simulator;realistic mobility traces;vehicular ad hoc networks;Ad hoc networks;Broadcasting;Cities and towns;Communications Society;Microscopy;Road transportation;Routing protocols;Telecommunication traffic;Traffic control;Wireless LAN}, 
doi={10.1109/INFCOM.2007.223}, 
ISSN={0743-166X},}

@INPROCEEDINGS{acar_iccccn2008, 
author={Qing Yang and Lim, A. and Shuang Li and Jian Fang and Agrawal, P.}, 
booktitle={Computer Communications and Networks, 2008. ICCCN '08. Proceedings of 17th International Conference on}, title={ACAR: Adaptive Connectivity Aware Routing Protocol for Vehicular Ad Hoc Networks}, 
year={2008}, 
pages={1-6}, 
abstract={Developing routing protocol for vehicular ad hoc networks (VANET) is a challenging task due to potentially large network sizes, rapidly changing topology and frequent network disconnections, which can cause failure or inefficiency in traditional ad hoc routing protocols. We propose an adaptive connectivity aware routing (ACAR) protocol that addresses these problems by adaptively selecting an optimal route with the best network transmission quality based on the statistical and realtime density data that are gathered through an on-the-fly density collection process. The protocol consists of two parts: (1) select an optimal route, consisting of road segments, with the best estimated transmission quality (2) in each road segment in the selected route, select the most efficient multi-hop path that will improve delivery ratio and throughput. The optimal route can be selected using our new connectivity model that takes into account vehicles densities and traffic light periods to estimate transmission quality at road segments, which considers the probability of connectivity and data delivery ratio for transmitting packets. In each road segment along the optimal path, each hop is selected to minimize the packet error rate of the entire path. Our simulation results show that the proposed ACAR protocol outperforms existing VANET routing protocols in terms of data delivery ratio, throughput and data packet delay. In addition, ACAR works very well even if accurate statistical data is not available.}, 
keywords={ad hoc networks;mobile radio;routing protocols;telecommunication network reliability;telecommunication traffic;VANET;adaptive connectivity aware routing protocol;data delivery ratio;data packet delay;multihop path;network transmission quality;on-the-fly density collection process;road segment;routing protocol;throughput delay;traffic light periods;transmission quality;vehicular ad hoc networks;Ad hoc networks;Delay;Error analysis;Network topology;Road safety;Road vehicles;Routing protocols;Throughput;Vehicle safety;Wireless sensor networks}, 
doi={10.1109/ICCCN.2008.ECP.107}, 
ISSN={1095-2055},}


@INPROCEEDINGS{5464797, 
author={Tuan Do and Mark, B.L.}, 
booktitle={Information Sciences and Systems (CISS), 2010 44th Annual Conference on}, title={Cooperative communication with regenerative relays for cognitive radio networks}, 
year={2010}, 
pages={1-6}, 
keywords={cognitive radio;decoding;radio receivers;radio transmitters;telecommunication channels;telecommunication links;average symbol error probability;cognitive radio networks;cooperative communication;decode-and-forward transmission strategy;direct communication link;licensed users;primary transmitter;primaryusers;regenerative relays;relay channel;secondary receiver;secondary transmitter;secondary users;spatial-temporal sensing;wireless systems;Cognitive radio;Collaboration;Decoding;Diversity reception;Frequency;Interference;Radio transmitters;Receivers;Relays;Strontium;Cognitive radio;cooperative communications;dynamic spectrum access}, 
doi={10.1109/CISS.2010.5464797},}


@MISC{Khorashadi07impactof,
    author = {Behrooz Khorashadi and Andrew Chen and Dipak Ghosal and Chen-nee Chuah and Michael Zhang},
    title = {Impact of transmission power on the performance of UDP in vehicular ad hoc networks,” ICC},
    year = {2007}
    notse = {bigger transmission power decreases the number of hops, but causes interference when transmission power exceeds a certain level. This can be used to argue that transmission can not be done with high power.
    in the evaluation, sufficient connectivity is guaranteed by large transmission range and high density.
  
    
    }
}

@INPROCEEDINGS{routingMetric_greedyRouting09infocom, 
author={Yujun Li and Yang, Y. and Xianliang Lu}, 
booktitle={Proc. of IEEE INFOCOM 2009}, 
title={Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing}, 
//year={2009}, 
pages={64-72}, 
abstract={Different geographic routing protocols have different requirements on routing metric designs to ensure proper operation. Combining a wrong type of routing metric with a geographic routing protocol may produce unexpected results, such as geographic routing loops and unreachable nodes. In this paper, we propose a novel routing algebra system to investigate the compatibilities between routing metrics and three geographic routing protocols including greedy, face and combined-greedy- face routing. Four important algebraic properties, respectively named odd symmetry, transitivity, source independence and local minimum freeness, are defined in this algebra system. Based on these algebraic properties, the necessary and sufficient conditions for loop-free and delivery guaranteed routing are derived when greedy, face and combined-greedy-face routing serve as packet forwarding schemes or as path discovery algorithms respectively. Our work provides essential criterions for evaluating and designing geographic routing protocols.}, 
keywords={greedy algorithms;routing protocols;combined-Greedy-face routing;geographic routing protocols;routing metric designs;unreachable nodes;Algebra;Communications Society;Computer science;Design engineering;Global Positioning System;Peer to peer computing;Routing protocols;Switches;USA Councils;Wireless networks}, 
doi={10.1109/INFCOM.2009.5061907}, 
notes={give sufficient conditions of causing loop, which is very helpful
}
ISSN={0743-166X},}

@INPROCEEDINGS{DesignGuidlin_routingMetric_08infocom, 
author={Yang, Y. and Jun Wang}, 
booktitle={INFOCOM 2008. The 27th Conference on Computer Communications. IEEE}, 
title={Design Guidelines for Routing Metrics in Multihop Wireless Networks}, 
year={2008}, 
pages={1615-1623}, 
abstract={The design of a routing protocol must be based on the characteristics of its target networks. The diversity of wireless networks motivates the design of different routing metrics, capturing different aspects of wireless communications. The design of routing metrics, however, is not arbitrary since it has a great impact on the proper operation of routing protocols. Combining a wrong type of routing metrics with a routing protocol may result in routing loops and suboptimal paths. In this paper, we thoroughly study the relationship between routing metrics and routing protocols. Our work provides important guidelines for designing routing metrics and identifies the specific properties that a routing metric must have in order to be combined with certain type of routing protocols.}, 
keywords={diversity reception;radio networks;routing protocols;multihop wireless network diversity;routing metrics design guideline;routing protocol;wireless communication;Algorithm design and analysis;Communications Society;Diversity reception;Guidelines;Mathematical model;Network topology;Routing protocols;Spread spectrum communication;Wireless communication;Wireless networks}, 
doi={10.1109/INFOCOM.2008.222}, 
ISSN={0743-166X},}

@inproceedings{nadv_MobiHoc05,
 author = {Lee, Seungjoon and Bhattacharjee, Bobby and Banerjee, Suman},
 title = {Efficient geographic routing in multihop wireless networks},
 booktitle = {Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing},
 series = {MobiHoc '05},
 year = {2005},
 isbn = {1-59593-004-3},
 location = {Urbana-Champaign, IL, USA},
 pages = {230--241},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/1062689.1062720},
 doi = {10.1145/1062689.1062720},
 acmid = {1062720},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {geographic routing, link cost estimation, routing metric, wireless multihop networks},
 note={
 new greedy routing metric about per, delay, and power consumption.
 gpsr, no deadend or isolated node are considered
 }
}

@inproceedings{Bose:2009:BLD:1582716.1582756,
 author = {Bose, Prosenjit and Carmi, Paz and Durocher, Stephane},
 title = {Bounding the locality of distributed routing algorithms},
 booktitle = {Proceedings of the 28th ACM symposium on Principles of distributed computing},
 series = {PODC '09},
 year = {2009},
 isbn = {978-1-60558-396-9},
 location = {Calgary, AB, Canada},
 pages = {250--259},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/1582716.1582756},
 doi = {10.1145/1582716.1582756},
 acmid = {1582756},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {dilation, distributed algorithms, local routing},
}


@ARTICLE{fundamentalResultsWSN2012, 
author={Yi Shi and Hou, Y.T.}, 
journal={Networking, IEEE/ACM Transactions on}, 
title={Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks}, 
notes={

cope with the mobile sink in wsn inorder to improve the lifetime of the whole network.

1. transform the time-dependent problem to a location (space)-de-
pendent problem


2. the specific time in-
stances for the base station to visit a location is not important, as
long as the total sojourn time for the base station to be present
at this location is the same.

},
year={2012}, 
volume={20}, 
number={4}, 
pages={1054-1067}, 
keywords={Base stations;Energy consumption;Mobile communication;Mobile computing;Optimization;Robot sensing systems;Routing;Approximation algorithm;lifetime;mobile base station;optimization;sensor networks;theory}, 
doi={10.1109/TNET.2011.2171990}, 
ISSN={1063-6692},}


@inproceedings{setCoverGameSTOC03,
 author = {Anshelevich, Elliot and Dasgupta, Anirban and Tardos, Eva and Wexler, Tom},
 title = {Near-optimal network design with selfish agents},
 booktitle = {Proceedings of the thirty-fifth annual ACM symposium on Theory of computing},
 series = {STOC '03},
 year = {2003},
 isbn = {1-58113-674-9},
 location = {San Diego, CA, USA},
 pages = {511--520},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/780542.780617},
 doi = {10.1145/780542.780617},
 acmid = {780617},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {network design, price of anarchy},
}


@ARTICLE{offloading2012, 
author={Bo Han and Pan Hui and Kumar, V.S.A. and Marathe, M.V. and Jianhua Shao and Srinivasan, A.}, 
journal={Mobile Computing, IEEE Transactions on}, 
title={Mobile Data Offloading through Opportunistic Communications and Social Participation}, 
year={2012}, 
volume={11}, 
number={5}, 
pages={821-834}, 
keywords={3G mobile communication;cellular radio;graph theory;smart phones;social networking (online);telecommunication network routing;telecommunication traffic;3G networks;Bluetooth interface;MoSoNets;Nokia N900 smartphones;Opp-off;cellular networks;content transfer;device/service discovery;greedy algorithm;heuristic algorithm;information delivery;information dissemination;mobile data offloading;mobile data traffic;mobile phones;mobile social networks;opportunistic communications;random algorithm;real-world mobility traces;social participation;target-set selection problem;trace-driven simulation study;Computer science;Femtocells;IEEE 802.11 Standards;Mobile communication;Mobile computing;Mobile handsets;Social network services;Mobile data offloading;implementation;mobile social networks;opportunistic communications;target-set selection;trace-driven simulation.}, 
doi={10.1109/TMC.2011.101}, 
ISSN={1536-1233},}


@inproceedings{klc-cssgecmrn-09,
 author = {Hyukjoon Kwon and HyungJune Lee and John M. Cioffi},
 title = {Cooperative Strategy by Stackelberg Games under Energy Constraint in Multi-hop Relay Networks},
 booktitle = {IEEE Globecom'09},
 year = {2009},
 location = {Hawaii, USA},
  publisher = {IEEE},
  notes= {
  1. discuss nodes' forwarding strategies, which are on one same routing path.
  2. Each node maintains credits table for 'neighbors'
  3. Node's unitity function is composed with throughtput utility and credit utility, both of which are function of credits and willingness.
  4. formulate the transmission into a sequential-move game, where each sender-relay pair conducts a stackelberg game. Solving the game (maxmizing utility, with constraints of power consumption) brings willingness and accordingly the possiblity of forwarding.
  
  merits:
  1. doesn't isolate selfish nodes
  2. proposes one strategy for all users, but doesn't promise any rewards for them, this maybe a reason for the low forwarding probability (70%).
  
  downsides:  
  1. this paper only talks about the transmission along one 'best' path which has been found beforehand (one advantage claimed by anthored to \cite{competitionRelay08infocom}), in case the relay refuses to forward, the packet is simpily dropped.
  2. As the there is only forwarding probability, so the throughput is not one goal.
  },
 }
 
@INPROCEEDINGS{competitionRelay08infocom, 
author={Yufang Xi and Yeh, E.M.}, 
booktitle={INFOCOM 2008. The 27th Conference on Computer Communications. IEEE}, 
title={Pricing, Competition, and Routing for Selfish and Strategic Nodes in Multi-Hop Relay Networks}, 
year={2008}, 
pages={-}, 
abstract={We study pricing games in multi-hop relay networks where nodes price their services and route their traffic selfishly and strategically. Each node (1) makes a bid to each of its customers, specifying a charging function and a proposed traffic share, and (2) allocates its received traffic to its service providers. A node aims to maximize its profit from forwarding traffic. We show that the socially optimal routing can always be induced by an equilibrium where no node can increase its profit by unilaterally changing its bids. Inefficient equilibria arise in oligopolies due to the monopolistic pricing power of a superior relay. It results in finite price of anarchy if marginal cost functions are concave, but unbounded price of anarchy when they are convex. Pricing games of general topology suffer from the intrinsic multi-hop network structure, which gives rise to infinite price of anarchy.}, 
keywords={game theory;pricing;telecommunication network routing;telecommunication traffic;charging function;multi-hop relay networks;oligopolies;pricing games;routing;selfish nodes;strategic nodes;traffic share;Communications Society;Cost function;Network topology;Peer to peer computing;Pricing;Relays;Routing;Spread spectrum communication;Telecommunication traffic;USA Councils}, 
doi={10.1109/INFOCOM.2008.205}, 
ISSN={0743-166X},}



@INPROCEEDINGS{relayIncompleteInfo11icc, 
author={Hongda Xiao and Yeh, E.M.}, 
booktitle={Communications Workshops (ICC), 2011 IEEE International Conference on}, 
title={Pricing Games with Incomplete Information in Parallel Relay Networks}, 
year={2011}, 
pages={1-6}, 
abstract={We investigate the impact of incomplete information on the problem of pricing and incentives in a two-hop parallel relay network with one source and multiple relays. We consider a pricing game with incomplete information where the relays advertise traffic dependent charging functions to the source, which then allocates its traffic in a multipath manner and pays the relays according to the advertised charging functions. In our setting, the state of the links for a given relay is not observable by the source or the other relays, although the prior distribution of the types is observable. To provide a benchmark, we first show that in the pricing game with complete information, Nash equilibria exist and are all efficient. In particular, there exist efficient equilibria resulting from linear charging functions. On the other hand, we show that in the game with incomplete information, linear charging functions may lead to inefficiencies. In particular, we quantify the efficiency loss in the symmetric case, where the type distributions and cost structure are identical for all relays.}, 
keywords={game theory;telecommunication network management;telecommunication network topology;telecommunication traffic;Nash equilibria;incomplete information impact;linear charging function;link state distribution;multiple relays;pricing game;source relay;traffic allocation;traffic dependent charging function;two-hop parallel relay network;Bayesian methods;Cost function;Games;Nash equilibrium;Pricing;Relays;Resource management}, 
doi={10.1109/iccw.2011.5963529},}

@article{vcSurvey01,
 author = {Hightower, Jeffrey and Borriello, Gaetano},
 title = {Location Systems for Ubiquitous Computing},
 journal = {Computer},
 issue_date = {August 2001},
 volume = {34},
 number = {8},
 month = aug,
 year = {2001},
 issn = {0018-9162},
 pages = {57--66},
 numpages = {10},
 url = {http://dx.doi.org/10.1109/2.940014},
 doi = {10.1109/2.940014},
 acmid = {621777},
 publisher = {IEEE Computer Society Press},
 address = {Los Alamitos, CA, USA},
}

@book{Intro_MarkovChain_book,
  added-at = {2009-08-21T10:05:12.000+0200},
  address = {Princeton, NJ},
  author = {Stewart, {William J.}},
  biburl = {http://www.bibsonomy.org/bibtex/2c31ba7d7c7fc95f098f41a322c9ad35c/fbw_hannover},
  interhash = {b8dfe88c21eab7ffbf2eff1113dbbc44},
  intrahash = {c31ba7d7c7fc95f098f41a322c9ad35c},
  isbn = {0691036993},
  keywords = {Markov-Kette Markov-Prozess Markov_processes Numerical_solutions Numerisches_Verfahren Wahrscheinlichkeitsrechnung},
  pagetotal = {XIX, 539},
  ppn_gvk = {152880593},
  publisher = {Princeton Univ. Press},
  timestamp = {2009-08-21T10:05:12.000+0200},
  title = {Introduction to the numerical solution of Markov chains},
  url = {http://gso.gbv.de/DB=2.1/CMD?ACT=SRCHA&SRT=YOP&IKT=1016&TRM=ppn+152880593&sourceid=fbw_bibsonomy},
  year = 1994
}

@article{geoClusterRouting05_goergen,
 author = {Frey, Hannes and G\"{o}rgen, Daniel},
 title = {Planar graph routing on geographical clusters},
 journal = {Ad Hoc Netw.},
 issue_date = {September, 2005},
 volume = {3},
 number = {5},
 month = sep,
 year = {2005},
 issn = {1570-8705},
 pages = {560--574},
 numpages = {15},
 url = {http://dx.doi.org/10.1016/j.adhoc.2004.08.013},
 doi = {10.1016/j.adhoc.2004.08.013},
 acmid = {1640943},
 publisher = {Elsevier Science Publishers B. V.},
 address = {Amsterdam, The Netherlands, The Netherlands},
 keywords = {Ad-hoc networks, Geographic routing, Overlay networks, Sensor networks, Topology control},
}

@INPROCEEDINGS{Perkins97ad-hocon-demand,
    author = {Charles E. Perkins and Elizabeth M. Royer},
    title = {Ad-hoc On-Demand Distance Vector Routing},
    booktitle = {ProcEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS},
    year = {1997},
    pages = {90--100},
    publisher = {}
}




@ARTICLE{Niculescu03positionand,
    author = {Dragos Niculescu and Badri Nath},
    title = {Position and Orientation in Ad Hoc Networks},
    journal = {AD HOC NETWORKS},
    year = {2003},
    volume = {2},
    pages = {133--151}
}

@INPROCEEDINGS{search_geo_routing_chowdhury, 
author={Chowdhury, K.R. and Di Felice, M.}, 
booktitle={Proc. of IEEE Sarnoff Sym. '09}, 
title={{SEARCH:} A routing protocol for mobile cognitive radio ad-Hoc networks}, 
//year={2009}, 
pages={1-6}, 
abstract={Recent research in the emerging field of cognitive radio (CR) has mainly focused on spectrum sensing and sharing, that allow an opportunistic use of the vacant portions of the licensed frequency bands by the CR users. Efficiently leveraging this node channel information in order to provide timely end-to-end delivery over the network is a key concern for CR based routing protocols. In addition, the primary users (PUs) of the licensed band affect the channels to varying extents, depending on the proportion of the transmission power that gets leaked into the adjacent channels. This also effects the geographical region, in which, the channel is rendered unusable for the CR users. In this paper, a geographic forwarding based SpEctrum aware routing protocol for Cognitive ad-Hoc networks (SEARCH), is proposed that jointly undertakes path and channel selection to avoid regions of PU activity during route formation. Specifically, the optimal paths found by geographic forwarding on each channel are combined at the destination with an aim to minimize the hop count. By binding the route to regions found free of PU activity, rather than particular CR users, the effect of the PU activity is mitigated. Our proposed approach is thoroughly evaluated through simulation study.}, 
keywords={ad hoc networks;cognitive radio;mobile radio;routing protocols;SEARCH;adjacent channels;channel selection;end-to-end delivery;geographic forwarding;mobile cognitive radio ad-hoc networks;path selection;spectrum aware routing protocol for cognitive ad-hoc networks;transmission power;Ad hoc networks;Availability;Chromium;Cognitive radio;Delay;Frequency;Laboratories;Radio broadcasting;Routing protocols;TV}, 
doi={10.1109/SARNOF.2009.4850323},}

@INPROCEEDINGS{caodv-10wd,
author={Cacciapuoti, A.S. and Calcagno, C. and Caleffi, Marcello and Paura, L.}, 
booktitle={Proc. of IFIP Wireless Days 2010}, 
title={{CAODV:} Routing in mobile ad-hoc cognitive radio networks}, 
notes={  


}

keywords={cognitive radio;mobile ad hoc networks;protocols;radio networks;telecommunication network routing;CAODV protocol;ad-hoc on-demand distance vector;channel selection;cognitive mobile ad hoc networks;mobile ad hoc cognitive radio networks;packet discovery;route cost;route formation;Ad hoc networks;Cognitive radio;Copper;Mobile communication;Routing;Routing protocols;ad hoc;cognitive;manet;routing}, 
doi={10.1109/WD.2010.5657754}, 
ISSN={2156-9711},}

@inproceedings{ICNP10_VC-wsn,
 author = {Zhou, Jiangwei and Chen, Yu and Leong, Ben and Feng, Boqin},
 title = {Practical Virtual Coordinates for large wireless sensor networks},
 booktitle = {Proc. of IEEE ICNP '10},

}


@article{Wellens200910,
title = {Empirical time and frequency domain models of spectrum use},
journal = {Physical Communication},
volume = {2},
number = {1–2},
pages = {10 - 32},
year = {2009},
author = {Matthias Wellens and Janne Riihijärvi and Petri Mähönen},
}


@Article{reactiveCRN-survey13,
AUTHOR = {Salim, Shelly and Moh, Sangman},
TITLE = {On-demand routing protocols for cognitive radio ad hoc networks},
JOURNAL = {EURASIP Journal on Wireless Communications and Networking},
VOLUME = {2013},
YEAR = {2013},
NUMBER = {1},
PAGES = {102},
URL = {http://jwcn.eurasipjournals.com/content/2013/1/102},
DOI = {10.1186/1687-1499-2013-102},
ISSN = {1687-1499},
ABSTRACT = {Cognitive radio ad hoc networks (CRAHNs) are a class of cognitive radio networks. In recent years, they have gained popularity, and routing protocols have been proposed. Above all, the protocols based on on-demand routing are considered favorable in the literature. It is mainly because the accomplishments of ad hoc on-demand distance vector (AODV) routing and dynamic source routing (DSR) in mobile ad hoc networks have lead to a number of adaptations of both protocols to suit CRAHNs. In this paper, we review the on-demand routing protocols applicable for CRAHNs, which are based on AODV, DSR, and hybrid protocols. After explaining their basic principles, we qualitatively compare the protocols in terms of inherent characteristics and performance. This paper further addresses the pros and cons of routing protocols and discusses research challenges and open issues.},
}

@article{data-centric02sigcomm,
 author = {Shenker, Scott and Ratnasamy, Sylvia and Karp, Brad and Govindan, Ramesh and Estrin, Deborah},
 title = {Data-centric storage in sensornets},
 journal = {SIGCOMM Comput. Commun. Rev.},
 issue_date = {January 2003},
 volume = {33},
 number = {1},
 month = jan,
 year = {2003},
 issn = {0146-4833},
 pages = {137--142},
 numpages = {6},
 url = {http://doi.acm.org/10.1145/774763.774785},
 doi = {10.1145/774763.774785},
 acmid = {774785},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@inproceedings{Kuhn_grouting_focs03,
 author = {Kuhn, Fabian and Wattenhofer, Rogert and Zhang, Yan and Zollinger, Aaron},
 title = {Geometric ad-hoc routing: of theory and practice},
 booktitle = {Proceedings of the twenty-second annual symposium on Principles of distributed computing},
 series = {PODC '03},
 year = {2003},
 isbn = {1-58113-708-7},
 location = {Boston, Massachusetts},
 pages = {63--72},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/872035.872044},
 doi = {10.1145/872035.872044},
 acmid = {872044},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Ad-Hoc Networks, Cost Metrics, Face Routing, Geometric Routing, Mobile Computing, Performance, Routing, Wireless Communication},
}

@inproceedings{ICNP10_VC-wsn,
 author = {Zhou, Jiangwei and Chen, Yu and Leong, Ben and Feng, Boqin},
 title = {Practical Virtual Coordinates for large wireless sensor networks},
 booktitle = {Proc. of IEEE ICNP '10},
 aaaseries = {ICNP '10},
 aaayear = {2010},
 isbn = {978-1-4244-8644-1},
 aaapages = {41--51},
 numpages = {11},
 url = {http://dx.doi.org/10.1109/ICNP.2010.5762753},
 doi = {10.1109/ICNP.2010.5762753},
 acmid = {2015483},
 aaapublisher = {IEEE Computer Society},
 aaaaddress = {Washington, DC, USA},
}
 
@INPROCEEDINGS{networkFormationGame08, 
author={Arcaute, E. and Johari, R. and Mannor, S.}, 
booktitle={Communication, Control, and Computing, 2008 46th Annual Allerton Conference on}, 
title={Local dynamics for network formation games}, 
year={2008}, 
pages={937-938}, 
keywords={game theory;local dynamics;myopic dynamics;network formation games;self-interested nodes;Contracts;Costs;Engineering management;Game theory;IP networks;Nash equilibrium;Peer to peer computing;Telecommunication traffic;Traffic control;Transportation}, 
doi={10.1109/ALLERTON.2008.4797658},}

@ARTICLE{opt_dsa_09_TMC, 
author={Senhua Huang and Xin Liu and Zhi Ding}, 
journal={IEEE Transactions on Mobile Computing}, 
title={Optimal Transmission Strategies for Dynamic Spectrum Access in Cognitive Radio Networks}, 
year={2009}, 
volume={8}, 
number={12}, 
pages={1636-1648}, 
abstract={Cognitive radio offers a promising technology to mitigate spectrum shortage in wireless communications. It enables secondary users (SUs) to opportunistically access low-occupancy primary spectral bands as long as their negative effect on the primary user (PU) access is constrained. This PU protection requirement is particularly challenging for multiple SUs over a wide geographical area. In this paper, we study the fundamental performance limit on the throughput of cognitive radio networks under the PU packet collision constraint. With perfect sensing, we develop an optimum spectrum access strategy under generic PU traffic patterns. Without perfect sensing, we quantify the impact of missed detection and false alarm, and propose a modified threshold-based spectrum access strategy that achieves close-to-optimal performance. Moreover, we develop and evaluate a distributed access scheme that enables multiple SUs to collectively protect the PU while adapting to behavioral changes in PU usage patterns. Our results provide useful insight on the trade-off between the protection of the primary user and the throughput performance of cognitive radios.}, 
keywords={cognitive radio;distributed algorithms;telecommunication security;telecommunication traffic;PU protection requirement;cognitive radio networks;distributed access scheme;dynamic spectrum access;false alarm;low-occupancy primary spectral bands;missed detection;optimal transmission strategy;packet collision constraint;primary user access;secondary users;threshold-based spectrum access strategy;traffic patterns;wireless communications;Wireless communication;cognitive radio;dynamic spectrum access;optimization.}, 
doi={10.1109/TMC.2009.84}, 
ISSN={1536-1233},}

@INPROCEEDINGS{Newsome03gem,
    author = {James Newsome and Dawn Song},
    title = {GEM: Graph EMbedding for Routing and Data-Centric Storage in Sensor Networks without Geographic Information},
    booktitle = {},
    year = {2003},
    pages = {76--88},
    publisher = {ACM Press}
}

@ARTICLE{gameRoutingSurvey2008, 
author={Pavlidou, Fotini-Niovi and Koltsidas, Georgios}, 
journal={Journal of Communications and Networks}, 
title={Game theory for routing modeling in communication networks - A survey}, 
year={2008}, 
volume={10}, 
number={3}, 
pages={268-286}, 
keywords={Ad hoc networks;Cost function;Game theory;Games;Routing;Throughput;Vectors;Ad hoc networks;Bayesian games;Nash equilibrium;game theory;network routing;price of anarchy;routing modeling;sensor networks}, 
doi={10.1109/JCN.2008.6388348}, 
ISSN={1229-2370},}

@article{DBLP:journals/tosn/XuRHLCD13,
  author    = {Yinsheng Xu and
               Fengyuan Ren and
               Tao He and
               Chuang Lin and
               Canfeng Chen and
               Sajal K. Das},
  title     = {Real-time routing in wireless sensor networks: A potential
               field approach},
  journal   = {TOSN},
  volume    = {9},
  number    = {3},
  year      = {2013},
  pages     = {35},
  ee        = {http://doi.acm.org/10.1145/2480730.2480738},
notes={proposes a routing scheme to distinguish delay sensitive and non delay-sensitive packets. inject the delay sensitive pkts into the short paths(multiple paths to the sink node has been found. improved protocol based on 'network calulus' is used to decrease the delay for those delay sensitive pkts.)
},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@inproceedings{openRadio13,
 author = {Bansal, Manu and Mehlman, Jeffrey and Katti, Sachin and Levis, Philip},
 title = {OpenRadio: a programmable wireless dataplane},
 booktitle = {Proceedings of the first workshop on Hot topics in software defined networks},
 series = {HotSDN '12},
 year = {2012},
 isbn = {978-1-4503-1477-0},
 location = {Helsinki, Finland},
 pages = {109--114},
 numpages = {6},
 url = {http://doi.acm.org/10.1145/2342441.2342464},
 doi = {10.1145/2342441.2342464},
 acmid = {2342464},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {dataplane, infrastructure, programmable, wireless},
}

@ARTICLE{routing-crn-jsac12, 
author={Yongkang Liu and Cai, L.X. and Xuemin Shen}, 
journal={IEEE Journal on Selected Areas in Communications}, 
title={Spectrum-Aware Opportunistic Routing in Multi-Hop Cognitive Radio Networks}, 
year={2012}, 
volume={30}, 
number={10}, 
pages={1958-1968}, 
keywords={cognitive radio;routing protocols;wireless channels;CTT;OCR protocol;channel usage statistics;cognitive routing;cognitive transport throughput;dynamic spectrum access opportunities;geographic location information;local spectrum access opportunities;multichannel multihop CRN;multichannel multihop cognitive radio network;multihop cognitive radio networks;opportunistic cognitive routing protocol;searching complexity reduction;secondary user;spectrum dynamics;spectrum sensing;spectrum-aware opportunistic routing;Delay;Optical character recognition software;Protocols;Relays;Routing;Sensors;Cognitive radio;dynamic spectrum access;multi-hop transmission;opportunistic routing}, 
doi={10.1109/JSAC.2012.121111}, 
ISSN={0733-8716},
notes={
compare with SEARCH;

new opportunistic cognitive routing metric is in unit of bit*meter/second;

compared with \cite{routing-crn-globcom11}, sender chooses a sets of relays for each channel, choose the set with the biggest 	choose channel, give priorities;

A heuristic method to form relay set, whose time complexity if O(m*n^2);

delay performance is very close to the global optimal.


}
}

@INPROCEEDINGS{routing-crn-globcom11, 
author={Yongkang Liu and Cai, L.X. and Xuemin Shen}, 
booktitle={Proc. of IEEE GLOBECOM 2011}, 
title={Joint Channel Selection and Opportunistic Forwarding in Multi-Hop Cognitive Radio Networks}, 
year={2011}, 
pages={1-5}, 
keywords={channel estimation;cognitive radio;diversity reception;multiuser channels;packet radio networks;radio links;radio spectrum management;CRN;channel metric;channel selection;cognitive radio networks;multiuser diversity reception;node residence strategy;opportunistic packet forwarding;relay links;relay nodes;residence channel;spectrum opportunities detection;spectrum sensing;Channel estimation;Delay;Optical character recognition software;Peer to peer computing;Relays;Sensors}, 
doi={10.1109/GLOCOM.2011.6134270}, 
ISSN={1930-529X},
notes={

Assume the T_ON is exponentially distributed;

Decision is made for each packet: 

spectrum sensing is needed for each channel, then design utility for each channel, which considers the probality that the packet can be successfully transmitted (prediction based scheme); sender chooses the channel which has the highest probability that the channel will be free for data transmission.

relay resides on the channel which has the best historical records, answer RREP when hearing RREQ.

doesn't state clearly the whether the formed path strenchs a lot or not.

compared with \cite{routing-crn-jsac12}, the sender totally decides channel and relay.


}
}

@INPROCEEDINGS{routing-crn-icc11, 
author={Yongkang Liu and Cai, L.X. and Xuemin Shen and Mark, Jon W.}, 
booktitle={Proc. of IEEE ICC 2011}, 
title={Exploiting Heterogeneity Wireless Channels for Opportunistic Routing in Dynamic Spectrum Access Networks}, 
year={2011}, 
pages={1-5}, 
keywords={cognitive radio;geometry;greedy algorithms;relays;subscriber loops;telecommunication network reliability;telecommunication network routing;wireless channels;DSA network;OCR scheme;PU;SU;channel access opportunity;channel sensing sequence;dynamic spectrum access networks;geometry information;greedy forwarding scheme;heterogeneity wireless channels;hop relay;opportunistic cognitive routing scheme;primary user;routing control message;routing decision;secondary user;spectrum band;Delay;Optical character recognition software;Relays;Routing;Routing protocols;Sensors;Wireless sensor networks}, 
doi={10.1109/icc.2011.5962417}, 
ISSN={1550-3607},
Notes={
geolocation based, PU history involved scheme.
1.forwarding decision for each packet.
2.sender sends packet on the first encourterred idle channel (update sensing sequence)
3.all the neighbors hearing the packets repaly rrep which contains its utility. The utility is decided by its forwarding history(successful sending) and 'normalized advance'.

problem: The nexthop with biggest utility will be chosen... this could lead to strenched path.
}
}

@INPROCEEDINGS{Routing-crn-INFOCOM11, 
author={Miao Pan and Chi Zhang and Pan Li and Yuguang Fang}, 
booktitle={Proc. of IEEE INFOCOM 2011}, 
title={Joint routing and link scheduling for cognitive radio networks under uncertain spectrum supply}, 
keywords={cognitive radio;computational complexity;mathematical analysis;scheduling;telecommunication network routing;NP-hard problem;coarse-grained fixing algorithm;cognitive radio networks;joint routing;licensed spectrum supply;link scheduling;mathematical formulation;multihop CR networks;optimization problem;uncertain spectrum supply;Bandwidth;Optical wavelength conversion;Positron emission tomography}, 
doi={10.1109/INFCOM.2011.5935039}, 
ISSN={0743-166X},}

@INPROCEEDINGS{cnfMac-globecom10, 
author={Cai, L.X. and Yongkang Liu and Xuemin Shen and Mark, Jon W. and Dongmei Zhao}, 
booktitle={Proc. of IEEE GLOBECOM 2010}, 
title={Distributed QoS-Aware MAC for Multimedia over Cognitive Radio Networks}, 
year={2010}, 
pages={1-5}, 
keywords={access protocols;cognitive radio;multimedia communication;quality of service;channel sensing;channel usage pattern;data transmission;distributed QoS-aware MAC protocol;multichannel cognitive radio network;multimedia;quality of service;Analytical models;Cognitive radio;Delay;Media Access Protocol;Multimedia communication;Quality of service;Sensors}, 
doi={10.1109/GLOCOM.2010.5683743}, 
ISSN={1930-529X},}

@INPROCEEDINGS{data-centric-CRN-dyspan08, 
author={Wiggins, U. and Rajgopal Kannan and Chakravarthy, V. and Vasilakos, A.V.}, 
booktitle={New Frontiers in Dynamic Spectrum Access Networks, 2008. DySPAN 2008. 3rd IEEE Symposium on}, 
title={Data-Centric Prioritization in a Cognitive Radio Network: A Quality-of-Service Based Design and Integration}, 
year={2008}, 
pages={1-11}, 
keywords={cognitive radio;quality of service;QoS methodology;application-specific design requirements;cognitive radio frequency decision;cognitive radio network;data-centric prioritization;decision collisions;frequency evaluation-determination methodology;network collisions;quality-of-service;Cognition;Cognitive radio;Computer networks;Computer science;FCC;Laboratories;Military computing;Quality of service;Radio frequency;Telecommunication computing}, 
doi={10.1109/DYSPAN.2008.62},}

@ARTICLE{MulticastCRN-jsac11-gao, 
author={Cunhao Gao and Yi Shi and Hou, Y.T. and Sherali, H.D. and Huaibei Zhou}, 
journal={IEEE Journal on Selected Areas in Communications}, 
title={Multicast Communications in Multi-Hop Cognitive Radio Networks}, 
year={2011}, 
volume={29}, 
number={4}, 
pages={784-793}, 
keywords={cognitive radio;multicast communication;radio networks;bit rate requirement;mixed integer linear program;multicast communication;multihop cognitive radio network;polynomial time algorithm;Ad hoc networks;Bismuth;Interference;Optimization;Routing;Scheduling;Spread spectrum communication;Multicast;ad hoc networks;cognitive radio;optimization;resource allocation}, 
doi={10.1109/JSAC.2011.110410}, 
ISSN={0733-8716},}

@ARTICLE{delay-cogwsn-2014, 
author={Shah, G. and Alagoz, F. and Fadel, E. and Akan, O.}, 
journal={IEEE Transactions on Vehicular Technology}, 
title={A Spectrum-Aware Clustering for Efficient Multimedia Routing in Cognitive Radio Sensor Networks}, 
year={2014}, 
volume={PP}, 
number={99}, 
pages={1-1}, 
keywords={Cognitive radio;Delays;Multimedia communication;Quality of service;Routing;Time division multiple access;Wireless sensor networks;Cognitive radio sensor networks;clustering;cross-layer routing;multimedia}, 
doi={10.1109/TVT.2014.2300141}, 
ISSN={0018-9545},}

@ARTICLE{geoRouing-qos-2009, 
author={Abdrabou, A. and Weihua Zhuang}, 
journal={IEEE Transactions on Wireless Communications}, 
title={Statistical {QoS} routing for {IEEE} 802.11 multihop ad hoc networks}, 
year={2009}, 
volume={8}, 
number={3}, 
pages={1542-1552}, 
keywords={ad hoc networks;probability;quality of service;routing protocols;wireless LAN;IEEE 802.11;bursty traffic sources;cross-layer design;end-to-end delay;geographical on-demand ad hoc routing protocol;link-layer channel modeling;multihop ad hoc networks;probability;quality of service routing;wireless LAN;Ad hoc networks;Availability;Cross layer design;Delay;Quality of service;Routing protocols;Spread spectrum communication;Stochastic processes;Telecommunication traffic;Traffic control;Ad hoc network;IEEE 802.11 MAC;call admission control;end-to-end delay;resource allocation;routing}, 
doi={10.1109/TWC.2008.080573}, 
ISSN={1536-1276},}

@ARTICLE{vc-mobile-2007, 
author={Yao Zhao and Yan Chen and Bo Li and Qian Zhang}, 
journal={Mobile Computing, IEEE Transactions on}, 
title={Hop ID: A Virtual Coordinate based Routing for Sparse Mobile Ad Hoc Networks}, 
year={2007}, 
volume={6}, 
number={9}, 
pages={1075-1089}, 
keywords={ad hoc networks;mobile radio;routing protocols;Hop ID routing;geographical routing;mobile ad hoc networks;routing protocol;telecommunication routing;virtual coordinate based routing;wireless communication systems;Ad hoc networks;Algorithm design and analysis;Analytical models;Availability;Bandwidth;Large-scale systems;Mobile ad hoc networks;Routing protocols;Scalability;Wireless communication;Mobile ad hoc networks;routing protocols;virtual coordinate}, 
doi={10.1109/TMC.2007.1042}, 
ISSN={1536-1233},}

@INPROCEEDINGS{spectrumDecision_2013mass, 
author={Saifan, R. and Kamal, A.E. and Yong Guan}, 
booktitle={Proc. of IEEE MASS 2012}, 
title={Spectrum decision for efficient routing in cognitive radio network}, 
//year={2012}, 
//month={Oct}, 
//pages={371-379}, 
keywords={cognitive radio;radio networks;radio spectrum management;radiofrequency interference;routing protocols;wireless channels;CR nodes;CRN;PU tolerable interference delay;TID;cognitive radio network routing;cognitive radio nodes;end-to-end path;licensed primary users;route setup decision;routing protocols;routing quality metric;spectrum band;spectrum decision;spectrum decision framework}, 
doi={10.1109/MASS.2012.6502537},}

@ARTICLE{spectrum-discovery-tmc08, 
author={Hyoil Kim and Shin, K.G.}, 
journal={IEEE Transactions on Mobile Computing}, 
title={Efficient Discovery of Spectrum Opportunities with MAC-Layer Sensing in Cognitive Radio Networks}, 
year={2008}, 
month={May}, 
volume={7}, 
number={5}, 
pages={533-545}, 
keywords={access protocols;channel allocation;channel estimation;cognitive radio;minimisation;time-varying channels;MAC-layer sensing;cognitive radio networks;delay minimization;dynamic spectrum allocation;environment-adaptive channel-usage pattern estimation;idle-channel discovery delay;licensed channels availability;optimal channel-sequencing technique;sensing-period adaptation;sensing-period optimization;spectrum availability;spectrum opportunities discovery;time-varying channel-parameters tracking;Emerging technologies;Mobile communication systems;Network management;Network monitoring;communication}, 
doi={10.1109/TMC.2007.70751}, 
ISSN={1536-1233},}



@ARTICLE{ca_mobility_jsac08, 
author={Al-Fuqaha, A. and Khan, B. and Rayes, A. and Guizani, M. and Awwad, O. and Ben Brahim, G.}, 
journal={Selected Areas in Communications, IEEE Journal on}, 
title={Opportunistic Channel Selection Strategy for Better QoS in Cooperative Networks with Cognitive Radio Capabilities}, 
year={2008}, 
month={Jan}, 
volume={26}, 
number={1}, 
pages={156-167}, 
keywords={ad hoc networks;channel estimation;error statistics;fuzzy logic;mobile radio;quality of service;QoS;channel estimation;cognitive radio;connection bit error rate;cooperative mobility;cooperative network;decentralized algorithm;fuzzy based techniques;mission-oriented MANET;mobile wireless ad-hoc network;opportunistic channel selection strategy;Ad hoc networks;Cognitive radio;Costs;Land vehicles;Marine vehicles;Mobile communication;Quality of service;Radio frequency;Road vehicles;Unmanned aerial vehicles}, 
doi={10.1109/JSAC.2008.080114}, 
ISSN={0733-8716},}



@MISC{SpectrumBridge,
//author = {Doe, Ringo},
//title = {This is a test entry of type {@ONLINE}},
//month = jun,
//year = {2009},
howpublished = "\url{http://whitespaces.spectrumbridge.com/}",
}

@INPROCEEDINGS{increaseTVWS12, 
author={Ellingsaeter, B. and Bezabih, H. and Noll, J. and Maseng, T.}, 
booktitle={Processings of 2012 IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN)}, 
title={Using {TV} receiver information to increase cognitive white space spectrum}, 
year={2012}, 
month={Oct}, 
pages={131-141}, 
keywords={cognitive radio;radio spectrum management;television broadcasting;television receivers;FCC;Ofcom;TV bands;TV broadcast stations;TV receiver information;TV receivers location;broadcast station service area;cognitive radio devices;cognitive white space spectrum;harmful interference;real statistics-based simulations;service area;Cognitive radio;Databases;FCC;TV;TV broadcasting;TV receivers;White spaces;Cognitive radio;TV receiver registration;gray space;white space}, 
doi={10.1109/DYSPAN.2012.6478124},}


@INPROCEEDINGS{Technical_Challenges_TVwhit,
author={Shellhammer, S.J. and Sadek, A.K. and Wenyi Zhang}, 
booktitle={Proc. of Information Theory and Applications Workshop, 2009}, 
title={Technical challenges for cognitive radio in the {TV} white space spectrum}, 
year={2009}, 
month={Feb}, 
pages={323-333}, 
keywords={cognitive radio;signal processing;MAC layer design;TV white space spectrum;cognitive radio;spectrum sensing;wireless PHY;Cognitive radio;FCC;Mobile radio mobility management;Radio frequency;Space technology;TV;Transmitting antennas;White spaces;Wireless networks;Wireless sensor networks}, 
doi={10.1109/ITA.2009.5044964},}


@INPROCEEDINGS{Coexistence_TVWS_feng_2011ICC,
author={Xiaojun Feng, Qian Zhang and Bo Li }, 
booktitle={Proc. of IEEE ICC, 2013}, 
title={Enabling Co-channel Coexistence of 802.22 and 802.11af Systems in {TV} White Spaces}, 
notes={prpose a solution for co-existence of 802.22 and 802.11af}
}



@MISC{802.22,
title = {{IEEE} 802.22 Wireless Regional Area Networks},
howpublished = "\url{http://www.ieee802.org/22/Technology/}",
}


@MISC{802.19,
title = {Wireless Coexistence in the {TV} White Space},
howpublished = "\url{http://ieee802.org/19/pub/TG1.html}",
}

@ARTICLE{802.11af, 
author={Flores, A.B. and Guerra, R.E. and Knightly, E.W. and Ecclesine, P. and Pandey, S.}, 
journal={Communications Magazine, IEEE}, 
title={{IEEE} 802.11af: a standard for {TV} white space spectrum sharing}, 
year={2013}, 
month={October}, 
volume={51}, 
number={10}, 
pages={92-100}, 
keywords={frequency allocation;radio direction-finding;telecommunication network reliability;television standards;wireless LAN;GDB;IEEE 802.11af standard;TV white space spectrum sharing;WSD;availability;frequency allocation;geolocation database;heterogeneous service;multiple regulatory domain;static spectrum allocation;unlicensed white space device;wireless device;Databases;IEEE 802.11 standards;Interference;Licenses;Spread spectrum management;TV;White spaces}, 
doi={10.1109/MCOM.2013.6619571}, 
ISSN={0163-6804},}


@MISC{802.15.4m,
title = {{TV} White Space Amendment to 802.15.4},
howpublished = "\url{http://www.ieee802.org/15/pub/TG4m.html}",
}

@INPROCEEDINGS{uplink_power_tvws13, 
author={Xin Tao and Zhifeng Zhao and Honggang Zhang}, 
booktitle={Proc. of IEEE WCNC 2013}, 
title={Location information based interference control for cognitive radio network in {TV} white spaces}, 
//year={2013}, 
//month={April}, 
pages={3614-3619}, 
keywords={Aggregates;Cognitive radio;Interference;Resource management;TV;TV receivers;White spaces}, 
doi={10.1109/WCNC.2013.6555147}, 
notes={
solve the power allocation in uplink scenario.
optimation, constains are interfernece on TV receivers, and capacity of secodnary terminals.
},
ISSN={1525-3511},}

@INPROCEEDINGS{SA_CA_TVWS_2012crowncom, 
author={Bo Ye and Nekovee, M. and Pervez, A. and Ghavami, M.}, 
booktitle={Proc. of 2012 7th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications }, 
title={{TV} white space channel allocation with Simulated Annealing as meta algorithm}, 
year={2012}, 
month={June}, 
pages={175-179}, 
notes={channel allocation!},
keywords={channel allocation;interference suppression;simulated annealing;television;TV spectrum;TV white space channel allocation;TVWS devices;TVWS system;automatic selection;channel allocation;digital switchover;meta algorithm;simulated annealing;total interference minimization;Annealing;Channel allocation;Interference;Resource management;Schedules;Simulated annealing;TV;Channel Allocation;Hyper-heuristics Algorithm;Simulated Annealing;TV White Space}, 
ISSN={2166-5370},}


@INPROCEEDINGS{game_CA_association_ICDCS12, 
author={Chen, Xu and Jianwei Huang}, 
notes={has many similarities with DIcaps},
booktitle={Proc. of 2012 IEEE 32nd International Conference on Distributed Computing Systems (ICDCS)}, 
title={Game Theoretic Analysis of Distributed Spectrum Sharing with Database}, 
year={2012}, 
month={June}, 
pages={255-264}, 
keywords={Algorithm design and analysis;Databases;Games;Heuristic algorithms;Manganese;Nash equilibrium;TV;database;distributed spectrum sharing;game theory;white space}, 
doi={10.1109/ICDCS.2012.37}, 
ISSN={1063-6927},}


@INPROCEEDINGS{tvws_vtc13, 
author={Di Felice, M. and Ghandhour, A.J. and Artail, H. and Bononi, L.}, 
booktitle={Proc. of IEEE VTC 2013 Fall}, 
title={Integrating Spectrum Database and Cooperative Sensing for Cognitive Vehicular Networks}, 
year={2013}, 
month={Sept}, 
pages={1-7}, 
keywords={cognitive radio;cooperative communication;optimisation;protocols;query processing;signal detection;vehicular ad hoc networks;FCC;ModeII devices;OFCOM;TV white spaces;bioinspired protocol;broadcast frequency;cognitive vehicular networks;congested urban scenarios;cooperative sensing-only devices;distributed protocol;licensed users;mobile vehicles;multiinterfaces vehicles;primary users detection overhead;secondary users;spectrum database querying;spectrum information;white space detection;Databases;Equations;Mathematical model;Sensors;TV;Vehicles;White spaces}, 
doi={10.1109/VTCFall.2013.6692244}, 
ISSN={1090-3038},}


@INPROCEEDINGS{withinTVcoverage_PIMRC13, 
author={Zhang, Long and Yuan, Lingwu and Feng, Zebing and Feng, Zhiyong}, 
notes={investigate how TVWS is distributed within the coverage,
optimazaton to assign power,
},
booktitle={Proc. of IEEE PIMRC 2013}, 
title={Mutual-interference-aware available spectrum resource distribution in {TV} white space}, 
year={2013}, 
month={Sept}, 
pages={2743-2747}, 
keywords={Aggregates;Interference;Resource management;TV;TV receivers;Transmitters;White spaces;TV white space;available resource distribution;cognitive radio;mutual interference;resource contour}, 
doi={10.1109/PIMRC.2013.6666613}, 
ISSN={2166-9570},}

@INPROCEEDINGS{802.22co-existence09, 
author={Kaigui Bian and Jung-Min Park}, 
booktitle={Proceedings of 18th Internatonal Conference on Computer Communications and Networks}, 
title={A Coexistence-Aware Spectrum Sharing Protocol for 802.22 {WRANs}}, 
year={2009}, 
month={Aug}, 
pages={1-6}, 
keywords={protocols;radio networks;radio spectrum management;television broadcasting;IEEE 802.22;TV broadcast band;WRAN;coexistence-aware spectrum sharing protocol;cognitive radio;dynamic resource sharing mechanism;wireless regional area network;wireless standard;Base stations;Chromium;Cognitive radio;Interference;Microphones;Resource management;Switches;TV broadcasting;Wireless application protocol;Wireless networks}, 
doi={10.1109/ICCCN.2009.5235391}, 
ISSN={1095-2055},}

@INPROCEEDINGS{topologycontrol_04, 
author={Li, N. and Hou, J.C.}, 
booktitle={INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies}, 
title={Topology control in heterogeneous wireless networks: problems and solutions}, 
year={2004}, 
month={March}, 
volume={1}, 
pages={-243}, 
keywords={ad hoc networks;telecommunication control;telecommunication network topology;wireless sensor networks;DLMST;DRNG;ad hoc network;directed local minimum spanning tree;directed relative neighborhood graph;heterogeneous wireless multihop network;localized topology control algorithm;nonuniform transmission range;wireless sensor network;Computer science;Energy efficiency;Intelligent networks;Mobile ad hoc networks;Network topology;Power generation;Spread spectrum communication;Tree graphs;Wireless networks;Wireless sensor networks}, 
doi={10.1109/INFCOM.2004.1354497}, 
ISSN={0743-166X},}


@ARTICLE{Connectivity_Heterogeneous11, 
author={Wei Ren and Qing Zhao and Swami, A.}, 
journal={Information Theory, IEEE Transactions on}, 
title={Connectivity of Heterogeneous Wireless Networks}, 
year={2011}, 
month={July}, 
volume={57}, 
number={7}, 
pages={4315-4332}, 
keywords={ad hoc networks;cognitive radio;radiofrequency interference;telecommunication traffic;cognitive radio;communication link;inner bound;interference range matching;large-scale ad hoc heterogeneous wireless networks;outer bound;percolation-based connectivity;phase transition phenomenon;primary traffic load;primary transmitters;secondary user exploit channels;Ad hoc networks;Delay;Interference;Receivers;Transmitters;Upper bound;Wireless networks;Cognitive radio;connectivity region;continuum percolation;critical densities;heterogeneous wireless network;phase transition}, 
doi={10.1109/TIT.2011.2145650}, 
ISSN={0018-9448},}


@INPROCEEDINGS{cluster_EW10, 
author={Asterjadhi, A. and Baldo, N. and Zorzi, M.}, 
booktitle={Proc. of European Wireless Conference 2010}, 
title={A cluster formation protocol for cognitive radio ad hoc networks}, 
notes={
1. clustering is done in order to apply network coded coginitve control channel(NC^4)!
2. node with the maximum number of commne channel within its k-hop neighborhood is chosen as clusterhead
3. memerbership clarification is not given consideration!
4. metrics: number of clusters, cluster size, and number of common channels, dissemination speed.
 },
//year={2010}, 
//month={April}, 
pages={955-961}, 
keywords={access protocols;ad hoc networks;cognitive radio;cluster formation protocol;cognitive radio ad hoc networks;network coded cognitive control channel;spectrum-aware neighbor discovery;Ad hoc networks;Base stations;Centralized control;Channel allocation;Chromium;Cognitive radio;Interference;Protocols;Resource management;Scalability}, 
doi={10.1109/EW.2010.5483442},}

@article{Consensus_based_clustering12,
year={2012},
issn={1001-6538},
journal={Chinese Science Bulletin},
volume={57},
doi={10.1007/s11434-012-5074-6},
title={Consensus-based decentralized clustering for cooperative spectrum sensing in cognitive radio networks},
notes={
distributed clustering scheme focusing on improving sesning ability.
},
//url={http://dx.doi.org/10.1007/s11434-012-5074-6},
publisher={SP Science China Press},
keywords={cognitive radio networks; spectrum sensing; decentralized clustering; unsupervised learning; consensus theory},
author={Wu, QiHui and Ding, GuoRu and Wang, JinLong and Li, XiaoQiang and Huang, YuZhen},
language={English}
}


@INPROCEEDINGS{clustering_globecom11, 
author={Huazi Zhang, Zhaoyang Zhang1, Huaiyu Dai, Rui Yin and Xiaoming Chen}, 
booktitle={Proc. of GLOBECOM 2011}, 
title={Distributed Spectrum-Aware Clustering in Cognitive Radio Sensor Networks}, 
notes={
1.distributed scheme, focus on minimize power consumption by controling the cluster size
2. the proposed scheme is stable in presense of PU's activity},
}

@article{LIU_TMC11_2,
  author    = {Sisi Liu and
               Loukas Lazos and
               Marwan Krunz},
  title     = {Cluster-Based Control Channel Allocation in Opportunistic
               Cognitive Radio Networks},
  journal   = {IEEE Trans. Mob. Comput.},
  volume    = {11},
  number    = {10},
  year      = {2012},
  pages     = {1436-1449},
  ee        = {http://doi.ieeecomputersociety.org/10.1109/TMC.2012.33},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@INPROCEEDINGS{Affinity_clustering_09icccn, 
author={Baddour, K.E. and Ureten, O. and Willink, T.J.}, 
booktitle={Proc. of ICCCN 2009}, 
title={Efficient Clustering of Cognitive Radio Networks Using Affinity Propagation}, 
//year={2009}, 
//month={Aug}, 
//pages={1-6}, 
keywords={ad hoc networks;cognitive radio;graph theory;groupware;message passing;radio networks;ad hoc network;affinity propagation;cognitive radio networks;collaborative wireless network clusters;efficient clustering;graphs;message passing;open spectrum access network;Ad hoc networks;Clustering algorithms;Cognitive radio;Collaboration;Collaborative work;Interference;Network topology;Routing;Transfer functions;Wireless networks}, 
doi={10.1109/ICCCN.2009.5235219}, 
ISSN={1095-2055},}

@article{repeated_congestinon_rationality12,
year={2012},
issn={0020-7276},
journal={International Journal of Game Theory},
volume={41},
number={3},
doi={10.1007/s00182-011-0309-3},
title={Repeated congestion games with bounded rationality},
url={http://dx.doi.org/10.1007/s00182-011-0309-3},
publisher={Springer-Verlag},
keywords={Folk theorem; Braess’s paradox; Network routing games; Private monitoring; Public monitoring; Anonymous games; Strategic complexity; Contagion strategy; Calendar strategy},
author={Scarsini, Marco and Tomala, Tristan},
pages={651-669},
language={English}
}

@article{CommunicationRendezvous_ToN13, 
author={Zhang, Y. and Yu, G. and Li, Q. and Wang, H. and Zhu, X. and Wang, B.}, 
journal={IEEE/ACM Trans. on Networking,}, 
title={Channel-Hopping-Based Communication Rendezvous in Cognitive Radio Networks}, 
year={2013}, 
month={}, 
volume={PP}, 
number={99}, 
pages={1-1}, 
keywords={Channel hopping;cognitive radio;communication rendezvous;dynamic spectrum access}, 
doi={10.1109/TNET.2013.2270443}, 
ISSN={1063-6692},}

@INPROCEEDINGS{cluster_routing_2013ICC, 
author={Shah, G.A. and Akan, O.B.}, 
booktitle={Proc. of IEEE ICC 2013}, 
title={Spectrum-aware cluster-based routing for cognitive radio sensor networks}, 
year={2013}, 
month={June}, 
pages={2885-2889}, 
keywords={cognitive radio;pattern clustering;telecommunication network routing;time division multiple access;CRSN;CSMA;MAC;SCR;TDMA;carrier sense multiple access;cluster head selection;cognitive radio sensor networks;continuous transmission opportunity;data routing;dynamic spectrum access;intercluster routing;smooth provision;spectrum aware cluster based routing;time division multiple access;Cognitive radio;Delays;Routing;Routing protocols;Thyristors;Time division multiple access;Cognitive radio sensor networks;clustering;cross-layer routing}, 
doi={10.1109/ICC.2013.6654979}, 
ISSN={1550-3607},}

@ARTICLE{coded_control_channel09, 
author={Asterjadhi, A. and Baldo, N. and Zorzi, M.}, 
journal={Network, IEEE}, 
title={A distributed network coded control channel for multihop cognitive radio networks}, 
year={2009},
month={July}, 
volume={23}, 
number={4}, 
pages={26-32}, 
keywords={access protocols;ad hoc networks;cognitive radio;multiuser detection;spread spectrum communication;distributed network coding;dynamic spectrum access;multichannel MAC solutions;multihop cognitive ad hoc networks;multihop cognitive radio networks;primary user detection;users exchange control information;virtual control channel;Ad hoc networks;Cognitive radio;Communication system control;Distributed control;Network coding;Proposals;Radio control;Spread spectrum communication;Switches;Telecommunication control}, 
doi={10.1109/MNET.2009.5191143}, 
ISSN={0890-8044},}


@INPROCEEDINGS{channelAllocation_relay_2010ICASSP, 
author={Guodong Zhao and Chenyang Yang and Li, G.Y. and Dongdong Li and Soong, A.}, 
booktitle={Proceedings of 2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)}, 
title={Channel allocation for cooperative relays in cognitive radio networks}, 
year={2010}, 
month={March}, 
pages={3258-3261}, 
keywords={channel allocation;cognitive radio;wireless channels;channel allocation;cognitive radio network;cognitive radio relay channel;cooperative relays;direct channel;dual-hop channel;end-to-end throughput;parallel end-to-end transmission;spectrum band;Channel allocation;Chromium;Cognitive radio;Intelligent networks;Modulation coding;Power system relaying;Relays;Telecommunication traffic;Throughput;Wireless communication;Cognitive radio;channel allocation;cooperative relays;spectrum sharing}, 
doi={10.1109/ICASSP.2010.5496040}, 
ISSN={1520-6149},
note = channel allocation papers need reading, what other benefits can be brought except for interference mitigation.

}


@INPROCEEDINGS{transMode_channelAllocation_icc13, 
author={Hao Chen and Pinyi Ren and Li Sun and Qinghe Du}, 
booktitle={Communications (ICC), 2013 IEEE International Conference on}, 
title={A joint optimization of transmission mode selection and resource allocation for cognitive relay networks}, 
year={2013}, 
month={June}, 
pages={2852-2856}, 
keywords={amplify and forward communication;channel allocation;cognitive radio;computational complexity;decode and forward communication;graph theory;optimisation;relay networks (telecommunication);CRN;Hungary algorithm;SU outage percentage minimization;amplify-and-forward transmission;channel allocation;cognitive relay networks;combinatorial optimization problem;decode-and-forward transmission;direct transmission;graph theory;joint optimization;link interruption reducction;max-matching problem;multidimensional optimization flexibility;polynomial computational complexity;relay nodes;relay selection;resource allocation;secondary users;spectrum availability heterogeneity;spectrum utilization;system optimization;transmission mode selection;Cognitive radio}, 
doi={10.1109/ICC.2013.6654973}, 
ISSN={1550-3607},}

@INPROCEEDINGS{channelAllocation_throughput_12wcnc, 
author={Tan, L.T. and Long Bao Le}, 
booktitle={Proc. of IEEE WCNC 2012}, 
title={Channel assignment for throughput maximization in cognitive radio networks}, 
//year={2012}, 
//month={April}, 
pages={1427-1431}, 
keywords={access protocols;cognitive radio;optimisation;wireless channels;access contention resolution;cognitive radio networks;derived MAC protocol;distributed MAC protocol;hardware-constrained secondary users;maximum throughput limit;nonoverlapping channel assignment algorithm;spectrum holes;throughput maximization;Algorithm design and analysis;Channel allocation;Cognitive radio;Media Access Protocol;Radiation detectors;Throughput;Channel assignment;MAC protocol;cognitive radio;spectrum sensing;throughput maximization}, 
doi={10.1109/WCNC.2012.6214004}, 
ISSN={1525-3511},}

@INPROCEEDINGS{6503270, 
author={Tan, L.T. and Long Bao Le}, 
booktitle={Global Communications Conference (GLOBECOM), 2012 IEEE}, 
title={Fair channel allocation and access design for cognitive ad hoc networks}, 
year={2012}, 
month={Dec}, 
pages={1162-1167}, 
keywords={access protocols;ad hoc networks;channel allocation;cognitive radio;optimisation;performance evaluation;radio spectrum management;search problems;telecommunication traffic;MAC protocol algorithm;NP-hard problem;access contention;access design;ad hoc network nodes;channel allocation algorithm;cognitive ad hoc networks;cognitive radio ad hoc network;fair channel allocation problem;fair channel assignment;fair spectrum sharing;hardware constraints;low-complexity algorithms;neighboring secondary nodes;network traffic flows;optimal brute-force search algorithm;optimal solution;performance evaluation;throughput analytical model;Channel assignment;MAC protocol;cognitive ad hoc network;fair resource allocation}, 
doi={10.1109/GLOCOM.2012.6503270}, 
ISSN={1930-529X},}

@MISC{osi,
title = {Information technology -- Open Systems Interconnection -- Basic Reference Model -- Conventions for the definition of OSI services},
howpublished = "\url{http://www.iso.org/iso/home/store/catalogue_tc/catalogue_detail.htm?csnumber=18824.}",
}

@inproceedings{game_cloudcomputing_energy12,
 author = {Ge, Yang and Zhang, Yukan and Qiu, Qinru and Lu, Yung-Hsiang},
 title = {A Game Theoretic Resource Allocation for Overall Energy Minimization in Mobile Cloud Computing System},
 booktitle = {Proceedings of the 2012 ACM/IEEE International Symposium on Low Power Electronics and Design},
 series = {ISLPED '12},
 year = {2012},
 isbn = {978-1-4503-1249-3},
 location = {Redondo Beach, California, USA},
 pages = {279--284},
 numpages = {6},
 //url = {http://doi.acm.org/10.1145/2333660.2333724},
 doi = {10.1145/2333660.2333724},
 acmid = {2333724},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {congestion game, game theory, mobile cloud computing, power management, virtualization},
}

@ARTICLE{Akyildiz06survey,
    author = {Ian F. Akyildiz and Won-Yeol Lee and Mehmet C. Vuran and Shantidev Mohanty},
    title = {NeXt generation/dynamic spectrum access/cognitive Radio Wireless Networks: A Survey},
    journal = {Computer networks journal (ELSEVIER)},
    year = {2006},
    volume = {50},
    pages = {2127--2159}
}

@phdthesis{2000mitola_cognitive_radio,
    abstract = {{This dissertation addresses the intersection of personal wireless technology and computational intelligence. The primary research issue addressed is the organization of radio domain knowledge into data structures processable in real-time that integrate machine learning and natural language processing technology into software radio. The thesis defines and develops the cognitive radio architecture. The features needed in the architecture are derived from cognitive radio use cases. These include inferring user communications context, shaping access- network demand, and realizing a protocol for real-time radio spectrum rental. Mathematical foundations for the knowledge-representation architecture are derived by applying point-set topology to the requirements of the use cases. This results in the set-theoretic ontology of radio knowledge defined in the Radio Knowledge Representation Language (RKRL). The mathematical analysis also demonstrates that isochronous radio software is not Turing- computable. Instead, it is constrained to a bounded-recursive subset of the total functions. A rapid-prototype cognitive radio, CR1, was developed to apply these mathematical foundations in a simulated environment. CR1 demonstrated the principles of cognitive radio and focused the research issues. This led to an important contribution of this dissertation, the cognitive radio architecture. This is an open architecture framework for integrating agent-based control, natural language processing, and machine learning technology into software-defined radio platforms.}},
    address = {Kista, Sweden},
    author = {Mitola, Joseph},
    citeulike-article-id = {9342875},
    citeulike-linkout-0 = {http://web.it.kth.se/\~{}maguire/jmitola/Mitola\_Dissertation8\_Integrated.pdf},
    day = {8},
    howpublished = {DTech thesis},
    institution = {Royal Institute of Technology (KTH)},
    issn = {1403-5286},
    keywords = {cognitive, cross-layer, radio, seminal},
    month = may,
    organization = {Royal Institute of Technology (KTH)},
    posted-at = {2011-05-27 01:22:20},
    priority = {1},
    publisher = {Royal Institute of Technology (KTH)},
    school = {Royal Institute of Technology (KTH)},
    title = {{Cognitive Radio --- An Integrated Agent Architecture for Software Defined Radio}},
    type = {{DTech} thesis},
//    url = {http://web.it.kth.se/\~{}maguire/jmitola/Mitola\_Dissertation8\_Integrated.pdf},
    year = {2000}
}



@ARTICLE{08crn_survey, 
author={Akyildiz, I.F. and Won-Yeol Lee and Vuran, Mehmet C. and Mohanty, S.}, 
journal={Communications Magazine, IEEE}, 
title={A survey on spectrum management in cognitive radio networks}, 
year={2008}, 
month={April}, 
volume={46}, 
number={4}, 
pages={40-48}, 
keywords={cognitive radio;radio spectrum management;cognitive radio networks;dynamic spectrum access techniques;heterogeneous wireless architectures;mobile users;spectrum management;Base stations;Baseband;Chromium;Cognitive radio;Hardware;RF signals;Radio frequency;Radio spectrum management;Transceivers;Wideband}, 
doi={10.1109/MCOM.2008.4481339}, 
ISSN={0163-6804},}

@article{coorperativeSensing_Akyildiz11,
 author = {Akyildiz, Ian F. and Lo, Brandon F. and Balakrishnan, Ravikumar},
 title = {Cooperative Spectrum Sensing in Cognitive Radio Networks: A Survey},
 journal = {Phys. Commun.},
 issue_date = {March, 2011},
 volume = {4},
 number = {1},
 month = mar,
 year = {2011},
 issn = {1874-4907},
 pages = {40--62},
 numpages = {23},
 //url = {http://dx.doi.org/10.1016/j.phycom.2010.12.003},
 doi = {10.1016/j.phycom.2010.12.003},
 acmid = {2295264},
 publisher = {Elsevier Science Publishers B. V.},
 address = {Amsterdam, The Netherlands, The Netherlands},
 keywords = {Cognitive radi	o, Cooperation, Data fusion, Overhead, Signal detection, Spectrum sensing, Wireless network},
}

@ARTICLE{crnsensing_09, 
author={Yucek, T. and Arslan, H.}, 
journal={In Proc. of IEEE Communications Surveys Tutorials}, 
title={A survey of spectrum sensing algorithms for cognitive radio applications}, 
year={2009}, 
volume={11}, 
number={1}, 
pages={116-130}, 
keywords={cognitive radio;radio access networks;sensors;spread spectrum communication;telecommunication traffic;cognitive radio applications;multidimensional spectrum sensing concept;network traffic;network utilization;opportunistic spectrum access concepts;primary user behavior;statistical modeling;Cognitive radio;Energy measurement;FCC;Frequency measurement;Predictive models;Radio spectrum management;Radiofrequency identification;Telecommunication traffic;Traffic control;Wireless sensor networks;Cognitive radio, spectrum sensing, dynamic spectrum access, multi-dimensional spectrum sensing, cooperative sensing, radio identification}, 
doi={10.1109/SURV.2009.090109}, 
ISSN={1553-877X},}


@INPROCEEDINGS{CRNspectrumSelection09_game, 
author={Malanchini, I. and Cesana, M. and Gatti, N.}, 
booktitle={Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE}, 
title={On Spectrum Selection Games in Cognitive Radio Networks}, 
year={2009}, 
month={Nov}, 
pages={1-7}, 
keywords={cognitive radio;game theory;radio networks;spread spectrum communication;cognitive radio networks;game theoretic framework;noncooperative game;secondary users;spectrum bandwidth;spectrum decision;spectrum management;spectrum mobility;spectrum selection games;spectrum sensing;spectrum sharing;Bandwidth;Cognitive radio;Costs;Frequency;Game theory;Interference;Quality of service;Radio spectrum management;Stability criteria;Time varying systems}, 
doi={10.1109/GLOCOM.2009.5425335}, 
ISSN={1930-529X},}

@ARTICLE{spectrum_decision_2013, 
notes={
nice survey on spectrum characteration, and spectrum selection (channel allocation) 
},
author={Masonta, M.T. and Mzyece, M. and Ntlatlapa, N.}, 
journal={Communications Surveys Tutorials, IEEE}, 
title={Spectrum Decision in Cognitive Radio Networks: A Survey}, 
year={2013}, 
month={Third}, 
volume={15}, 
number={3}, 
pages={1088-1107}, 
keywords={cognitive radio;quality of service;CR reconfiguration functions;CR research;CRN;PU activities;QoS requirements;SU;cognitive radio networks;quality of service requirements;radio environment conditions;secondary user;spectrum bands;spectrum decision;spectrum decision process;spectrum selection;traffic patterns;up-to-date survey;Cognitive radio;Computer architecture;Databases;Network topology;Sensors;Standardization;Cognitive Radio;Primary User;Reconfiguration;Secondary User;Spectrum Characterization;Spectrum Decision;Spectrum Selection}, 
doi={10.1109/SURV.2012.111412.00160}, 
ISSN={1553-877X},}

@INPROCEEDINGS{collaborative_spectrumRouting_06,
nodes={
Methdology has similiarity with SAViC, is not decouped method
}, 
author={Qiwei Wang and Haitao Zheng}, 
booktitle={Consumer Communications and Networking Conference, 2006. CCNC 2006. 3rd IEEE}, 
title={Route and spectrum selection in dynamic spectrum networks}, 
year={2006}, 
month={Jan}, 
volume={1}, 
pages={625-629}, 
keywords={Availability;Collaboration;Collaborative work;Computer science;Design methodology;Intelligent networks;Interference;Protocols;Radio spectrum management;Spread spectrum communication}, 
doi={10.1109/CCNC.2006.1593099},}

@ARTICLE{route_spectrum_allocation_11,
notes={propose routing robustness, which suports SAViC's idea}, 
author={Chao-Fang Shih and Wanjiun Liao and Hsi-Lu Chao}, 
journal={Wireless Communications, IEEE Transactions on}, 
title={Joint Routing and Spectrum Allocation for Multi-Hop Cognitive Radio Networks with Route Robustness Consideration}, 
year={2011}, 
month={September}, 
volume={10}, 
number={9}, 
pages={2940-2949}, 
keywords={ad hoc networks;cognitive radio;radio networks;telecommunication network routing;aggregate throughput;joint routing and spectrum allocation;multihop cognitive radio networks;polynomial time algorithm;route robustness consideration;route selection strategy;Joints;Resource management;Robustness;Routing;Spread spectrum communication;Throughput;Cognitive radio;robustness;routing;spectrum allocation}, 
doi={10.1109/TWC.2011.072011.101249}, 
ISSN={1536-1276},}

@ARTICLE{spectrum_decision_TMC11, 
author={Won-Yeol Lee and Akyldiz, I.F.}, 
journal={IEEE Transactions on Mobile Computing}, 
title={A Spectrum Decision Framework for Cognitive Radio Networks}, 
year={2011}, 
month={Feb}, 
volume={10}, 
number={2}, 
pages={161-174}, 
keywords={cognitive radio;bandwidth utilization;capacity constraints;capacity-based spectrum decision;cognitive radio networks;spectrum decision framework;Bandwidth;Chromium;Delay;Real time systems;Resource management;Sensors;Switches;Cognitive radio networks;best-effort application;maximum capacity-based spectrum decision;minimum variance-based spectrum decision;real-time application;resource management.;spectrum characterization;spectrum decision}, 
doi={10.1109/TMC.2010.147}, 
ISSN={1536-1233},}

@ARTICLE{channel_switch_delay11, 
author={Azarfar, A. and Frigon, J.-F. and Sanso, B.}, 
journal={Communications Surveys Tutorials, IEEE}, 
title={Improving the Reliability of Wireless Networks Using Cognitive Radios}, 
year={2012}, 
month={Second}, 
volume={14}, 
number={2}, 
pages={338-354}, 
keywords={cognitive radio;next generation networks;quality of service;telecommunication links;telecommunication network reliability;QoS;cognitive radios;communication link;next generation wireless services;quality of service;radio transmission medium;systematic failure classification procedure;wireless network reliability;wireline network reliability;Cognitive radio;Interference;Quality of service;Reliability;Tutorials;Wireless networks;Cognitive Radio;Failure;Prevention;Protection and Restoration;Reliability;Wireless Communications}, 
doi={10.1109/SURV.2011.021111.00064}, 
ISSN={1553-877X},}

@ARTICLE{ChannelManagement_80222_10,
notes={
very close paper to dicaps and thesis!to read!
}, 
author={GwangZeen Ko and Franklin, A.A. and Sung-Jin You and Jin-Suk Pak and Myung-Sun Song and Chang-Joo Kim}, 
journal={Communications Magazine, IEEE}, 
title={Channel management in IEEE 802.22 WRAN systems}, 
year={2010}, 
month={Sept}, 
volume={48}, 
number={9}, 
pages={88-94}, 
keywords={broadband networks;channel allocation;cognitive radio;telecommunication network management;IEEE 802.22;WRAN systems;broadband wireless access network;channel allocation;channel management policy;cognitive radio system;transmission power;wireless regional area networks;Classification algorithms;Cognitive radio;Databases;Sensors;TV;Wireless sensor networks}, 
doi={10.1109/MCOM.2010.5560592}, 
ISSN={0163-6804},}

@ARTICLE{Selforganization_CRN_13, 
author={Zhongshan Zhang and Keping Long and Jianping Wang}, 
journal={Wireless Communications, IEEE}, 
title={Self-organization paradigms and optimization approaches for cognitive radio technologies: a survey}, 
year={2013}, 
month={April}, 
volume={20}, 
number={2}, 
pages={36-42}, 
keywords={access protocols;cognitive radio;cooperative communication;quality of service;telecommunication control;telecommunication network routing;MAC-layer operations;adaptive routing;bioinspired spectrum sharing;centralized control;cognitive radio networks;cognitive radio technology;common control channel management;cooperative spectrum sensing;diverse QoS requirements;dynamic spectrum access;heterogeneous wireless network;large-scale networks;mobile users;network scalability;network-layer operations;optimization;self-organization paradigms;Bandwidth;Cognitive radio;Long Term Evolution;Mobile communication;Radio spectrum management;Wireless networks}, 
doi={10.1109/MWC.2013.6507392}, 
ISSN={1536-1284},}

@inproceedings{karp21_NPC_1971,
 author = {Cook, Stephen A.},
 title = {The Complexity of Theorem-proving Procedures},
 booktitle = {Proceedings of the Third Annual ACM Symposium on Theory of Computing},
 series = {STOC '71},
 year = {1971},
 location = {Shaker Heights, Ohio, USA},
 pages = {151--158},
 numpages = {8},
 url = {http://doi.acm.org/10.1145/800157.805047},
 doi = {10.1145/800157.805047},
 acmid = {805047},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@book{korte2007combinatorial,
  title={Combinatorial Optimization: Theory and Algorithms},
  author={Korte, B. and Vygen, J.},
  isbn={9783540718444},
  lccn={2007936375},
  series={Algorithms and Combinatorics},
  url={http://books.google.de/books?id=UnYwgPltSjwC},
  year={2007},
  publisher={Springer}
}


@Article{dancingLinks_Knuth,
     author    = "Donald E. Knuth",
     title     = "{Dancing links}",
     year      = "2000",
     eprint        = "hep-ph/9609357"
	 archivePrefix = "arXiv",
     eprint        = "0011047",
     primaryClass  = "cs",
}


@article{exact-set-cover-lu-2013,
  author    = {Songjian Lu and
               Xinghua Lu},
  title     = {An exact algorithm with the time complexity of $\mathcal{O}^*(1.299^m)$
               for the weighed mutually exclusive set cover problem},
  journal   = {CoRR},
  volume    = {abs/1302.5820},
  year      = {2013},
  ee        = {http://arxiv.org/abs/1302.5820},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}



@book{Computers_a_Intractability,
  author    = {M. R. Garey and David S. Johnson},
  title     = {Computers and Intractability: {A} Guide to the Theory of NP-Completeness},
  year      = {1979},
  publisher = {W. H. Freeman},
  isbn      = {0-7167-1044-7},
  timestamp = {Tue, 23 Sep 2014 23:26:27 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/books/fm/GareyJ79},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@INPROCEEDINGS{centralized_routing_07dyspan,
author={Pal, R.},
booktitle={Proc. of IEEE DySPAN 2007},
title={Efficient Routing Algorithms for Multi-Channel Dynamic Spectrum Access Networks},
year={2007},
month={April},
pages={288-291},
keywords={Pareto optimisation;combinatorial mathematics;multi-access systems;radio access networks;radio links;telecommunication network routing;Pareto optimal paths;combinatorial optimization;efficient routing algorithms;link disruption probabilities;link propagation time;multichannel dynamic spectrum access networks;single-radio multi-hop dynamic spectrum access networks;spectrum-aware data-adaptive routing;Broadcasting;FCC;Heuristic algorithms;Multicast algorithms;Multimedia communication;Polynomials;Radio spectrum management;Routing;Spread spectrum communication;Videoconference},
doi={10.1109/DYSPAN.2007.46},}

@inproceedings{Nagpal_2003,
 author = {Nagpal, Radhika and Shrobe, Howard and Bachrach, Jonathan},
 title = {Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network},
 booktitle = {Proceedings of the 2Nd International Conference on Information Processing in Sensor Networks},
 series = {IPSN'03},
 year = {2003},
 isbn = {3-540-02111-6},
 location = {Palo Alto, CA, USA},
 pages = {333--348},
 numpages = {16},
 url = {http://dl.acm.org/citation.cfm?id=1765991.1766014},
 acmid = {1766014},
 publisher = {Springer-Verlag},
 address = {Berlin, Heidelberg},
}


@book{Spectrum_Management07,
  author    = {Martin Cave and Chris Doyle and William Webb},
  title     = {Essentials of Modern Spectrum Management},
  year      = {2007},
  publisher = {Cambridge University Press},
  isbn      = {9780521876698},
}

@book{wireless_communicatioins2001,
 author = {Rappaport, Theodore},
 title = {Wireless Communications: Principles and Practice},
 year = {2001},
 isbn = {0130422320},
 edition = {2nd},
 publisher = {Prentice Hall PTR},
 address = {Upper Saddle River, NJ, USA},
}

@article{osa_Noam_1995,
 author = {Noam, E. M.},
 title = {Taking the Next Step Beyond Spectrum Auctions: Open Spectrum Access},
 journal = {Comm. Mag.},
 issue_date = {December 1995},
 volume = {33},
 number = {12},
 month = dec,
 year = {1995},
 issn = {0163-6804},
 pages = {66--73},
 numpages = {8},
 url = {http://dx.doi.org/10.1109/35.476925},
 doi = {10.1109/35.476925},
 acmid = {2288724},
 publisher = {IEEE Press},
 address = {Piscataway, NJ, USA},
}

@misc{FCC_03-322,
  title = {Order document {FCC} 03-322: Facilitating Opportunities for Flexible, Efficient, and Reliable Spectrum Use Employing Cognitive Radio Technologies},
  howpublished = {\url{https://apps.fcc.gov/edocs_public/attachmatch/FCC-03-322A1.pdf
}},
  note = {Accessed: 2014-12-26}
}

@book{agt_book,
  author    = {Noam Nisan and Tim Roughgarden and Eva Tardos and Vijay V. Vazirani},
  title     = {Algorithmic Game Theory},
  year      = {2007},
  publisher = {Cambridge University Press},
  isbn      = {9780521872829},
}



@incollection{agt_book_c1,
  author      = "Eva Tardos and Vijay Vazirani",
  title       = "Basic solution concepts and comupational issues",
  editor      = "Noam Nisan and Tim Roughgarden and Eva Tardos and Vijay V. Vazirani",
  booktitle   = "Algorithmic Game Theory",
  publisher   = "Cambridge University Press",
  year        = 2007,
  chapter     = 1,
}

@article{repeatedGamePowerControl_2010,
 author = {Treust, M. Le and Lasaulce, S.},
 title = {A Repeated Game Formulation of Energy-efficient Decentralized Power Control},
 journal = {Trans. Wireless. Comm.},
 issue_date = {September 2010},
 volume = {9},
 number = {9},
 month = sep,
 year = {2010},
 issn = {1536-1276},
 pages = {2860--2869},
 numpages = {10},
 url = {http://dx.doi.org/10.1109/TWC.2010.072610.091472},
 doi = {10.1109/TWC.2010.072610.091472},
 acmid = {1867124},
 publisher = {IEEE Press},
 address = {Piscataway, NJ, USA},
 keywords = {Cognitive radio, Folk theorem, Nash equilibrium, cognitive radio, energy-efficiency, folk theorem, nash equilibrium, power control games, repeated games},
 notes={
propose distributed algorithm for power control problem in CDMA network.
PC has been discussed in literatures, some of which are from the perspective of games.
Available PC algorithm is NE in one-shot game. 
The authors propose two repeated games (RG), inifite repeated game and discounted repeated game to improve PC from NE to PE(pareto E).
what is the contribution of this paper:
Propose algorithm to achieve PE, propose RG to achieve better accumlated utilites.


 
 }
}

%@INPROCEEDINGS{powercontrol_98, 
%author={Shah, V. and Mandayam, N.B. and Goodman, D.}, 
%booktitle={Proc. of IEEE PIMRC 1998}, 
%title={Power control for wireless data based on utility and pricing}, 
%year={1998}, 
%month={Sep}, 
%volume={3}, 
%pages={1427-1432 vol.3}, 
%keywords={code division multiple access;data communication;distributed control;game theory;personal communication networks;power control;telecommunication control;CDMA;Nash equilibrium;PCS;Pareto inefficient equilibrium;code division multiple access;distributed power control;mobile radio;noncooperative game;personal communication services;pricing;satisfaction;utility;wireless data;wireless data services;Bit error rate;Data communication;Error correction;Laboratories;Multiaccess communication;Power control;Power generation economics;Power system modeling;Pricing;Radio transmitters}, 
%doi={10.1109/PIMRC.1998.731433},
%notes={uplink PC, propose utility function for mobile users, then NE and PE are achieved}
%}

@INPROCEEDINGS{game_for_communication_01, 
author={MacKenzie, A.B. and Wicker, S.B.}, 
booktitle={Proc. of IEEE GLOBECOM 2001}, 
title={Game theory in communications: motivation, explanation, and application to power control}, 
//year={2001}, 
month={}, 
//volume={2}, 
//pages={821-826 vol.2}, 
keywords={access protocols;code division multiple access;game theory;power control;radio networks;telecommunication control;CDMA system;TCP/IP standard;communication problems;communications network;communications systems design;game theory;power control;slotted Aloha system;wireless system;Algorithm design and analysis;Application software;Centralized control;Communication system control;Communication systems;Game theory;Humans;Manufacturing;Power control;Power engineering computing}, 
doi={10.1109/GLOCOM.2001.965533},
notes={provide motivitions to use game theory to sutdy communication systems}
}


@INPROCEEDINGS{contentiongame_07, 
author={Lijun Chen and Low, S.H. and Doyle, J.C.}, 
booktitle={Proc. of 2007 46th IEEE Conference on Decision and Control}, 
title={Contention control: A game-theoretic approach}, 
year={2007}, 
month={Dec}, 
pages={3428-3434}, 
keywords={access protocols;game theory;quality of service;radio networks;Nash equilibria;contention control;contention resolution algorithm;contention-based medium access;game-theoretic approach;medium access control;per-node utility functions;quality of service;random access game;service differentiation;wireless networks;wireless nodes;Algorithm design and analysis;Design methodology;Distributed algorithms;Heuristic algorithms;Media Access Protocol;Nash equilibrium;Quality of service;Throughput;USA Councils;Wireless networks}, 
doi={10.1109/CDC.2007.4435015}, 
ISSN={0191-2216},}

@INPROCEEDINGS{g-dcf_2007, 
author={Guopeng Zhang and Hailin Zhang and Liqiang Zhao}, 
booktitle={Wireless, Mobile and Sensor Networks, 2007. (CCWMSN07). IET Conference on}, 
title={A novel MAC scheme for wireless LANs from the perspective of game theory}, 
year={2007}, 
month={Dec}, 
pages={112-116}, 
keywords={Bayes methods;access protocols;game theory;wireless LAN;IEEE 802.11 DCF;MAC scheme;Nash equilibrium;dynamic Bayesian game;game theory;multiple access game;wireless LAN;802.11 DCF;MAC;Nash equilibrium;game theory;wireless LANs}, 
ISSN={0537-9989},}

@phdthesis{Neel06analysisand,
 author = {Neel, James O'Daniell},
 advisor = {Reed, Jeffrey H.},
 title = {Analysis and Design of Cognitive Radio Networks and Distributed Radio Resource Management Algorithms},
 year = {2006},
 note = {AAI3249450},
 publisher = {Virginia Polytechnic Institute \& State University},
 address = {Blacksburg, VA, USA},
}

@phdthesis{phdthesis,
  author       = {Peter Joslin}, 
  title        = {The title of the work},
  school       = {The school where the thesis was written},
  year         = 1993,
  address      = {The address of the publisher},
  month        = 7,
  note         = {An optional note}
}



@article{Wang_gtc_crn_survey_2010,
 author = {Wang, Beibei and Wu, Yongle and Liu, K.J. Ray},
 title = {Game Theory for Cognitive Radio Networks: An Overview},
 journal = {Comput. Netw.},
 issue_date = {October, 2010},
 volume = {54},
 number = {14},
 month = oct,
 year = {2010},
 issn = {1389-1286},
 pages = {2537--2561},
 numpages = {25},
#url = {http://dx.doi.org/10.1016/j.comnet.2010.04.004},
 doi = {10.1016/j.comnet.2010.04.004},
 acmid = {1853631},
 publisher = {Elsevier North-Holland, Inc.},
 address = {New York, NY, USA},
 keywords = {Cognitive radio networks, Game theory, Wireless networks},
}

@INPROCEEDINGS{centralized_80222_sharing_ifip2011, 
author={Passiatore, C. and Camarda, P.}, 
booktitle={Proc. of 2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net), }, 
title={A centralized inter-network resource sharing ({CIRS}) scheme in {IEEE} 802.22 cognitive networks}, 
month={June}, 
pages={17-24}, 
keywords={IEEE standards;cognitive radio;interference suppression;radiofrequency interference;resource allocation;scheduling;telecommunication network reliability;television broadcasting;wireless channels;CIRS scheme;IEEE 802.22 standard;WRAN;centralized internetwork resource sharing scheme;cognitive radio network;collision free resource sharing method;interference;multichannel resource sharing scheme;primary user;resource distribution;spatial diversity;spectrum allocation;spectrum availability;spectrum scheduling;television broadcast service;wireless regional area network;Bandwidth}, 
doi={10.1109/Med-Hoc-Net.2011.5970487},
notes={propose an algorithm form spectrum sharing within 802.22 network, assume strict co-channel contention relation, i.e. overlapping cells should not use the same channel.
each channel proposes requeset of data, utility is to maximize a proposed formula related with it.
centralized scheme!
}
}



@INPROCEEDINGS{ca_crn_2009_coloring, 
author={Zhong Fan and Zhang, R.}, 
booktitle={Wireless Conference, 2009. EW 2009. European}, 
title={Spectrum allocation and medium access in cognitive radio wireless networks}, 
year={2009}, 
month={May}, 
pages={90-95}, 
keywords={access protocols;cognitive radio;graph colouring;interference;minimax techniques;radio spectrum management;telecommunication network topology;telecommunication traffic;IEEE 802.22 networks;MAC protocol;chromatic number;cognitive radio wireless networks;conflict graph;graph coloring algorithm;interference constraints;interference graph;max-min fair share algorithm;medium access protocol;network topology;proportional fair algorithm;spectrum allocation;traffic flows;Access protocols;Cognitive radio;Europe;Frequency;Interference constraints;Media Access Protocol;Network topology;TV;Telecommunication traffic;Wireless networks}, 
doi={10.1109/EW.2009.5357757},}

@INPROCEEDINGS{pimrc_2012, 
author={Omidvar, N. and Khalaj, B.H.}, 
booktitle={Proc. of IEEE PIMRC 2012}, 
title={A game-theoretic approach for joint channel and power allocation in downlink of cellular cognitive radio networks}, 
year={2012}, 
month={Sept}, 
pages={1198-1202}, 
abstract={In this paper, we consider a cellular cognitive radio network that uses opportunistic spectrum access for its transmission in the downlink direction from base stations toward cognitive radio users. Since the spectrum is licensed to a primary network, proper resource management should be employed in the secondary network to protect primary users against excessive interference while providing acceptable utilization for secondary users. We use game theory to propose a distributed method for joint frequency and power allocation in the downlink of cognitive radio networks. Earlier works in this area were based on centralized optimization-based approaches, whereas our proposed method solves the problem of joint resource allocation in a distributed way at lower complexity and less message passing. Comparing the proposed decentralized method with a centralized method shows that our proposed joint resource allocation scheme results in significantly less power consumption while supporting more secondary users.}, 
keywords={cellular radio;cognitive radio;game theory;optimisation;radio networks;resource allocation;base stations;cellular cognitive radio networks;centralized optimization-based approach;cognitive radio users;distributed method;downlink direction;excessive interference;game-theoretic approach;joint channel;power allocation;power consumption;resource management;secondary network;Cognitive radio;Downlink;Games;Interference;Joints;Radio spectrum management;Resource management;Cellular cognitive radio networks;distributed resource allocation;game theory;joint frequency and power allocation;potential games}, 
doi={10.1109/PIMRC.2012.6362528}, 
ISSN={2166-9570},
nots={
1. exact potential game? not sure
2. the paper doesn't provide means that base station obtain the needed information used to calculate the utility function.
3. punishment of violating the interference thresthold on primary users is incorperated in the utility function, but how does base station to know the interference received on the primary users is not considered.
},
}

@INPROCEEDINGS{Inter-Network_Spectrum_Sharing_80222_08, 
author={Wendong Hu and Gerla, M. and Vlantis, G.A. and Pottie, G.J.}, 
booktitle={In Proceedings of First International Workshop on Cognitive Radio and Advanced Spectrum Management 2008}, 
title={Efficient, flexible, and scalable inter-network spectrum sharing and communications in cognitive {IEEE} 802.22 networks}, 
year={2008}, 
month={Feb}, 
pages={1-5}, 
abstract={Although avoiding harmful interference to licensed incumbents is the prime concern of the system design for the emerging IEEE 802.22 standard, another key design challenge to cognitive radio based 802.22 systems is how to dynamically share the scarce spectrum among the collocated 802.22 network cells so that performance degradation, due to mutual co-channel interference, is effectively mitigated. This paper describes a distributed, cooperative, and real-time spectrum sharing protocol called On-Demand Spectrum Contention (ODSC) that employs interactive MAC messaging on an inter-network communication channel to provide efficient, scalable, and fair inter-network spectrum sharing among the coexisting 802.22 cells. Additionally, in order to support ODSC and other inter-network coordination functions in 802.22, we introduce a beacon-based inter-network communication protocol called the Beacon Period Framing (BPF) protocol that realizes a reliable, efficient, and scalable over-the- air inter-network communication channel utilizing the occupied RF channels of the network cells.}, 
keywords={IEEE standards;access protocols;cochannel interference;cognitive radio;interference suppression;radio spectrum management;wireless channels;RF channels;beacon period framing protocol;beacon-based internetwork communication protocol;cognitive IEEE 802.22 networks;cognitive radio;harmful interference;interactive MAC messaging;internetwork communication channel;internetwork spectrum sharing;mutual cochannel interference;network cells;ondemand spectrum contention;Access protocols;Base stations;Cognitive radio;Communication channels;Degradation;Digital TV;Interchannel interference;Media Access Protocol;Microphones;Telecommunication network reliability}, 
doi={10.1109/COGART.2008.4509981},

notes={ distributed Inter-Network Spectrum Sharing}

}

@misc{FCC_2010_sedond_memorandum,
  title = {Second memorandum opinion and order},
  howpublished = {\url{https://apps.fcc.gov/edocs_public/attachmatch/FCC-10-174A1.pdf
}},
  note = {Accessed: 2015-01-14}
}

@INPROCEEDINGS{power_control_utility_98, 
author={Shah, V. and Mandayam, N.B. and Goodman, D.}, 
//booktitle={Personal, Indoor and Mobile Radio Communications, 1998. The Ninth IEEE International Symposium on}, 
booktitle={Proc. of IEEE PIMRC 1998}, 
title={Power control for wireless data based on utility and pricing}, 
year={1998}, 
month={Sep}, 
volume={3}, 
pages={1427-1432 vol.3}, 
keywords={code division multiple access;data communication;distributed control;game theory;personal communication networks;power control;telecommunication control;CDMA;Nash equilibrium;PCS;Pareto inefficient equilibrium;code division multiple access;distributed power control;mobile radio;noncooperative game;personal communication services;pricing;satisfaction;utility;wireless data;wireless data services;Bit error rate;Data communication;Error correction;Laboratories;Multiaccess communication;Power control;Power generation economics;Power system modeling;Pricing;Radio transmitters}, 
doi={10.1109/PIMRC.1998.731433},}

@ARTICLE{downlink-centralized-08-TWC, 
author={Anh Tuan Hoang and Ying-Chang Liang}, 
journal={Wireless Communications, IEEE Transactions on}, 
title={Downlink Channel Assignment and Power Control for Cognitive Radio Networks}, 
year={2008}, 
month={August}, 
volume={7}, 
number={8}, 
pages={3106-3117}, 
keywords={channel allocation;cognitive radio;frequency division multiple access;graph theory;integer programming;linear programming;radio links;subscriber loops;base station;cognitive radio network;downlink channel assignment;downlink transmission;dynamic interference graph;excessive interference;fixed-location wireless subscriber;frequency division multiple access;mixed-integer linear programming;opportunistic spectrum access;power allocation;power control;Base stations;Bit error rate;Cognitive radio;Downlink;Frequency conversion;Frequency division multiaccess;Interference;Linear programming;Power control;Signal to noise ratio;Channel assignment;cognitive radio;power control;throughput maximization}, 
doi={10.1109/TWC.2008.070022}, 
ISSN={1536-1276},}

@ARTICLE{5776714, 
author={Duy Trong Ngo and Le-Ngoc, Tho}, 
journal={Vehicular Technology, IEEE Transactions on}, 
title={Distributed Resource Allocation for Cognitive Radio Networks With Spectrum-Sharing Constraints}, 
year={2011}, 
month={Sept}, 
volume={60}, 
number={7}, 
pages={3436-3449}, 
abstract={This paper presents new design formulations that aim at optimizing the performance of an orthogonal frequency-division multiple-access (OFDMA) ad hoc cognitive radio network through joint subcarrier assignment and power allocation. Aside from an important constraint on the tolerable interference induced to primary networks, to efficiently implement spectrum-sharing control within the unlicensed network, the optimization problems considered here strictly enforce upper and lower bounds on the total amount of temporarily available bandwidth that is granted to individual secondary users. These new requirements are of particular relevance in cognitive radio settings, where the spectral activities of primary users are highly dynamic, leaving little opportunity for secondary access. A dual decomposition framework is then developed for two criteria (throughput maximization and power minimization), which gives rise to the realization of distributed solutions. Because the proposed distributed protocols require very limited cooperation among the participating network elements, they are particularly applicable to ad hoc cognitive networks, where centralized processing and control are certainly inaccessible. In this paper, we recommend that the network collaboration is made possible through the implementation of virtual timers at individual secondary users and through the exchange of pertinent information over a common reserved channel. It is shown that not only is the computational complexity of the devised algorithms affordable but that the performance of these algorithms in practical scenarios attains the actual global optimum as well. The potential of the proposed approaches is thoroughly verified by asymptotic complexity analysis and numerical results.}, 
keywords={ad hoc networks;cognitive radio;communication complexity;frequency allocation;frequency division multiple access;optimisation;protocols;radiofrequency interference;wireless channels;OFDMA performance optimization;ad hoc cognitive radio network;asymptotic complexity analysis;computational complexity;distributed protocol;distributed resource allocation;dual decomposition framework;joint subcarrier assignment;network collaboration;orthogonal frequency division multiple access;power allocation;primary users;radiofrequency interference;secondary users;spectrum sharing constraint;spectrum sharing control;Ad hoc networks;Cognitive radio;Interference;OFDM;Optimization;Resource management;Throughput;Cognitive radio;distributed algorithm;dual optimization;orthogonal frequency-division multiple access (OFDMA);resource allocation;spectrum-sharing constraints}, 
doi={10.1109/TVT.2011.2157845}, 
ISSN={0018-9545},}

@INPROCEEDINGS{joint_power_channel_linkpair_08ICT, 
author={Bahramian, S. and Khalaj, B.H.}, 
booktitle={Telecommunications, 2008. ICT 2008. International Conference on}, 
title={Joint dynamic frequency selection and power control for cognitive radio networks}, 
year={2008}, 
month={June}, 
pages={1-6}, 
abstract={In this paper, joint dynamic frequency selection and transmit power control problem with the goal of power minimization for a target SINR is investigated for cognitive radio networks. The optimization problem is formulated and three algorithms are proposed: A centralized algorithm based on graph coloring, and two distributed algorithms based on game theory; one for coordinated and the other for non-coordinated scenarios. Performance of the proposed algorithms in terms of power minimization and convergence speed is evaluated through simulations. Comparing the performance with the optimum solution, all three algorithms show near-optimum power minimization performance for the simulated scenarios. Based on these results, scenarios in which each algorithm is more appropriate to be used are identified.}, 
keywords={cognitive radio;minimisation;power control;telecommunication congestion control;centralized algorithm;cognitive radio networks;convergence speed;distributed algorithms;game theory;graph coloring;joint dynamic frequency selection-power control;near-optimum power minimization performance;power minimization;transmit power control problem;Cognitive radio;Distributed algorithms;Frequency;Game theory;Interference;Minimization methods;Power control;Radio spectrum management;Radio transmitters;Signal to noise ratio;Cognitive Radio;Distributed Dynamic Frequency Selection;Distributed Transmit Power Control;Noncooperative Games}, 

doi={10.1109/ICTEL.2008.4652678},}

@techreport{hmam2010quadratic,
  title={Quadratic Optimisation with One Quadratic Equality Constraint},
  author={Hmam, Hatem},
  year={2010},
  institution={DTIC Document}
}

@article{Quadratic_min_one_equality,
year={2010},
issn={1435-246X},
journal={Central European Journal of Operations Research},
volume={18},
number={2},
doi={10.1007/s10100-009-0106-2},
title={Convex optimization approach to a single quadratically constrained quadratic minimization problem},
//url={http://dx.doi.org/10.1007/s10100-009-0106-2},
publisher={Springer-Verlag},
keywords={Quadratic minimization; Semidefinite optimization},
author={Salahi, Maziar},
pages={181-187},
language={English}
}

@INPROCEEDINGS{pr_cr_imperfectSensing_kkt_2012vtcfall, 
author={Hong Du and Zaixue Wei and Yu Wang and Dacheng Yang}, 
booktitle={Vehicular Technology Conference (VTC Fall), 2012 IEEE}, 
title={A High-Efficiency Resource Allocation Scheme under the Interference Constraints in Cognitive Radio}, 
year={2012}, 
month={Sept}, 
pages={1-5}, 
abstract={Resource allocation is one of the key issues to improve the efficiency of spectrum utilization in cognitive radio networks. It has been widely investigated with the assumption that the secondary users have a good knowledge of the channel state information of primary system. However, it is not reasonable in practice owing to the imperfect sensing. In this paper, a high-efficiency resource allocation scheme is proposed by considering the imperfect spectrum sensing. Particularly, in order to solve the problem of interference and lower efficiency of spectrum utilization, interference constraints and quality of service requirement are considered to reduce the impact from imperfect spectrum sensing. The goal of the presented scheme is to maximizing the capacity under the interference constraints of primary users. Simulation results indicate that the proposed resource allocation scheme can represent the better performance successfully.}, 
keywords={cognitive radio;interference (signal);quality of service;resource allocation;telecommunication channels;channel state information;cognitive radio networks;high-efficiency resource allocation scheme;interference constraints;primary system;quality of service requirement;secondary users;Cognitive radio;Interference constraints;Quality of service;Resource management;Sensors}, 
doi={10.1109/VTCFall.2012.6399076}, 
notes={power allocation problem.
consider impefect sensing, the requirement of sensing accuracy is formulated into constranit. kkt is used to obtain power and channel,

the transmission power is modelled to corelate with sensing decision.

},
ISSN={1090-3038},}

@ARTICLE{powerChannelAllocation_2015_shapley, 
author={Langar, R. and Secci, S. and Boutaba, R. and Pujolle, G.}, 
journal={IEEE Transactions on Mobile Computing, }, 
title={An Operations Research Game Approach for Resource and Power Allocation in Cooperative Femtocell Networks}, 
year={2015}, 
month={April}, 
volume={14}, 
number={4}, 
pages={675-687}, 
keywords={cooperative communication;femtocellular radio;game theory;operations research;optimisation;power control;radiofrequency interference;resource allocation;telecommunication control;Nucleolus;Shapley value;cooperative femtocell networks;cooperative game theory;femto-to-femto interference;indoor environments;macrocells;network capacity;operation research game approach;partial optimizations;performance degradation;power allocation problem;power control;power-level;resource allocation mechanisms;strategic interference management;throughput optimization;utility components;Femtocell networks;Games;Interference;Mobile computing;Optimization;Resource management;Tiles;Femtocell networks;nucleolus;operations research game;power control;resource allocation;shapley value}, 
doi={10.1109/TMC.2014.2329835}, 
notes={The purpose is to allocate resource block in terms of time and transmission among femtocells.
cooperation game is used to model and derive solutions.},
ISSN={1536-1233},}

@INPROCEEDINGS{tvwhiteSpace_resourceAllocation2014, 
author={Hessar, F. and Roy, S.}, 
booktitle={Dynamic Spectrum Access Networks (DYSPAN), 2014 IEEE International Symposium on}, 
title={Resource allocation techniques for cellular networks in {TV} white space spectrum}, 
year={2014}, 
month={April}, 
pages={72-81}, 
keywords={4G mobile communication;cellular radio;cochannel interference;resource allocation;telecommunication network reliability;television broadcasting;wireless LAN;3G networks;802.11 WLAN hotspot networks;FCC regulations;TV channels;TV white space spectrum;TVWS;channel allocation;channel availability;cochannel interferences;data offloading;digital over-the-air broadcasting;licensed 4G cellular networks;network performance metric;numerical evaluations;primary-to-secondary interference;resource allocation techniques;signal to interference and noise ratio;spatial variability;total network throughput;unlicensed secondary users;wireless networks;Availability;Channel allocation;FCC;Interference;TV;Throughput;White spaces;Cellular Network;Channel Allocation Problem;Cognitive Radio;Dynamic Spectrum Access;TV White Space (TVWS);Unlicensed Spectrum;Whitespaces},
notes={this work complies the regulation of FCC in terms of transmission power restriction, and proposes 2 heuristic channel allocation schemes, one is maximizing the total number of channels assigned to the entire network and another for maximizing total Shannon capacity of the network.}, 
doi={10.1109/DySPAN.2014.6817781},}

@INPROCEEDINGS{measurement_Palaios14,
author={Palaios, A. and Riihijarvi, J. and Mahonen, P.},
booktitle={Proc. of IEEE DySPAN 2014},
title={From {P}aris to {L}ondon: Comparative analysis of licensed spectrum use in two European metropolises},
year={2014},
month={April},
pages={48-59},
keywords={cellular radio;correlation methods;radio spectrum management;European metropolitan areas;cellular systems;data offloading technique;extensive cross-correlation analysis;frequency bands;licensed spectrum;spatial correlation structures;spectrum comparative analysis;spectrum sharing technique;Antenna measurements;Area measurement;Business;Cities and towns;Downlink;Frequency measurement;GSM},
doi={10.1109/DySPAN.2014.6817779},}

@INPROCEEDINGS{Alizai_11_probabilisticAddressing,
author={Alizai, M.H. and Vaegs, T. and Landsiedel, O. and G{\"o}tz, S. and Link, J.AB. and Wehrle, K.},
booktitle={Proc. of IPSN 2011},
title={Probabilistic addressing: Stable addresses in unstable wireless networks},
year={2011},
month={April},
pages={61-72},
keywords={probability;radio networks;telecommunication network routing;beacon vector routing;cluster based extension;point-to-point routing;probabilistic addressing mechanism;sensornets;unstable wireless networks;virtual coordinate based addressing mechanism;Ad hoc networks;History;Network topology;Probabilistic logic;Probability distribution;Routing;Routing protocols;Addressing;Tree Construction;Virtual Coordinates},}

@inproceedings{omnetpp_paper08,
	abstract = {The OMNeT++ discrete event simulation environment has been
publicly available since 1997. It has been created with the
simulation of communication networks, multiprocessors and other
distributed systems in mind as application area, but instead of
building a specialized simulator, OMNeT++ was designed to be as
general as possible. Since then, the idea has proven to work, and
OMNeT++ has been used in numerous domains from queuing
network simulations to wireless and ad-hoc network simulations,
from business process simulation to peer-to-peer network, optical
switch and storage area network simulations. This paper presents
an overview of the OMNeT++ framework, recent challenges
brought about by the growing amount and complexity of third
party simulation models, and the solutions we introduce in the
next major revision of the simulation framework.},
	keywords = {discrete simulation, network simulation, simulation tools,
performance analysis, computer systems, telecommunications,
hierarchical, integrated development environment},
	address = {ICST, Brussels, Belgium, Belgium},
	//publisher = {ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)},
	location = {Marseille, France},
	pages = {1--10},
	isbn = {978-963-9799-20-2},
	year = {2008},
	booktitle = {Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems \& workshops},
	title = {An overview of the OMNeT++ simulation environment},
	author = {Varga , Andr\'{a}s and Hornig , Rudolf}
}

@inproceedings{Mobileoffloading_2013,
 author = {Di Li and Asya Mitseva},
 title = {Mobile Adhoc Offloading in Wireless Ad hoc Network},
 booktitle={Proc. of MANIAC 2013: Mobile Offloading competition},
 address = {Berlin, Germany},
 year = {2013},
 ee ={http://arxiv.org/abs/1401.4528}
}


@ARTICLE{EnergyEfficientClusteringRouting_2015, 
author={Ali Jorio, Sanaa El Fkihi, Brahim Elbhiri, and Driss Aboutajdine}, 
journal={Journal of Computer Networks and Communications}, 
title={An Energy-Efficient Clustering Routing Algorithm Based on Geographic Position and Residual Energy for Wireless Sensor Network}, 
year={'15}, 
month={04}, 
volume={2015}, 
 doi = {10.1155/2015/170138},
}


@inproceedings{Sahai_FundamentalDesignTradeoffs2006,
 author = {Sahai, Anant and Tandra, Rahul and Mishra, Shridhar Mubaraq and Hoven, Niels},
 title = {Fundamental Design Tradeoffs in Cognitive Radio Systems},
 booktitle = {Proc. of ACM TAPAS '06},
 isbn = {1-59593-510-X},
// location = {Boston, Massachusetts, USA},
 articleno = {2},
 //url = {http://doi.acm.org/10.1145/1234388.1234390},
 doi = {10.1145/1234388.1234390},
 acmid = {1234390},
 //publisher = {ACM},
 //address = {New York, NY, USA},
 keywords = {SNR wall, cognitive radio, coherent/radiometric detection, cooperation radius, coordination radius, shadowing/fading},
}


@ARTICLE{channelHopping_Rendezvous_2014, 
author={Yifan Zhang and Gexin Yu and Qun Li and Haodong Wang and Xiaojun Zhu and Baosheng Wang}, 
journal={IEEE/ACM Transactions on Networking}, 
title={Channel-Hopping-Based Communication Rendezvous in Cognitive Radio Networks}, 
year={2014}, 
month={June}, 
volume={22}, 
number={3}, 
pages={889-902}, 
abstract={Cognitive radio (CR) networks have an ample but dynamic amount of spectrum for communications. Communication rendezvous in CR networks is the process of establishing a control channel between radios before they can communicate. Designing a communication rendezvous protocol that can take advantage of all the available spectrum at the same time is of great importance, because it alleviates load on control channels, and thus further reduces probability of collisions. In this paper, we present ETCH, efficient channel-hopping-based MAC-layer protocols for communication rendezvous in CR networks. Compared to the existing solutions, ETCH fully exploits spectrum diversity in communication rendezvous by allowing all the rendezvous channels to be utilized at the same time. We propose two protocols, SYNC-ETCH, which is a synchronous protocol assuming CR nodes can synchronize their channel hopping processes, and ASYNC-ETCH, which is an asynchronous protocol not relying on global clock synchronization. Our theoretical analysis and ns-2-based evaluation show that ETCH achieves better performances of time-to-rendezvous and throughput than the existing work.}, 
keywords={access protocols;cognitive radio;diversity reception;probability;radio spectrum management;wireless channels;ASYNC-ETCH;CR networks;SYNC-ETCH;channel-hopping-based MAC-layer protocols;channel-hopping-based communication rendezvous protocol;cognitive radio networks;collision probability reduction;control channel;dynamic spectrum access;ns-2-based evaluation;spectrum diversity;synchronous protocol;Algorithm design and analysis;IEEE transactions;Protocols;Schedules;Synchronization;Throughput;Channel hopping;cognitive radio;communication rendezvous;dynamic spectrum access}, 
doi={10.1109/TNET.2013.2270443}, 
ISSN={1063-6692},}

@ARTICLE{5G_2014, 
author={Chih-Lin I and Rowell, C. and Shuangfeng Han and Zhikun Xu and Gang Li and Zhengang Pan}, 
journal={Communications Magazine, IEEE}, 
title={Toward green and soft: a 5{G} perspective}, 
year={2014}, 
month={February}, 
volume={52}, 
number={2}, 
pages={66-73}, 
keywords={4G mobile communication;Internet;next generation networks;telecommunication power management;4G systems;5G perspective;Shannon theorem;base stations;cell-centric design;energy efficiency;full duplex radio;green networks;mobile Internet;network capacity;network power consumption;next generation wireless solutions;spectral efficiency co-design;Computer architecture;Energy efficiency;Green products;Mobile communication;Mobile computing;Next generation networking;Transceivers},
doi={10.1109/MCOM.2014.6736745}, 
ISSN={0163-6804},}

@ARTICLE{5directions5G_2014, 
author={Boccardi, F and Heath, R.W. and Lozano, A. and Marzetta, T.L. and Popovski, P.}, 
journal={Communications Magazine, IEEE}, 
title={Five disruptive technology directions for 5{G}}, 
year={2014}, 
month={February}, 
volume={52}, 
number={2}, 
pages={74-80}, 
keywords={MIMO communication;cellular radio;fifth generation systems;MIMO;architectural design;component disruptive design;device-centric architectures;fifth generation cellular networks;machine-to-machine communications;Antenna arrays;Base stations;Downlink;MIMO;Microwave communication;Next generation networking;Uplink}, 
doi={10.1109/MCOM.2014.6736746}, 
ISSN={0163-6804},}


@ARTICLE{zhao_survey_DSA_2007, 
author={Qing Zhao and Sadler, B.M.}, 
journal={Signal Processing Magazine, IEEE}, 
title={A Survey of Dynamic Spectrum Access}, 
year={2007}, 
month={May}, 
volume={24}, 
number={3}, 
pages={79-89}, 
keywords={radio spectrum management;signal processing;OSA;dynamic spectrum access;opportunistic spectrum access;opportunity identification module;regulatory aspects;signal processing;Cognitive radio;Force measurement;Frequency conversion;Radio frequency;Radio spectrum management;Taxonomy;Terminology;Time division multiple access;Time measurement;Traffic control}, 
doi={10.1109/MSP.2007.361604}, 
ISSN={1053-5888},}


@ARTICLE{dsa_traffic_2000, 
author={Lin Xu and T\"{o}njes, R. and Paila, T. and Hansmann, W. and Frank, M. and Albrecht, M.}, 
booktitle={Local Computer Networks, 2000. LCN 2000. Proceedings. 25th Annual IEEE Conference on}, 
title={{DRiVE}-ing to the Internet: Dynamic Radio for {IP} services in Vehicular Environments}, 
year={2000}, 
month={}, 
pages={281-289}, 
keywords={Internet;adaptive systems;cellular radio;multimedia communication;radio access networks;research initiatives;road traffic;road vehicles;traffic control;transport protocols;DRiVE network;DRiVE project;European Union;IP services;IPv6 based network infrastructure;Internet;adaptive services;cellular radio networks;dynamic radio;dynamic spectrum allocation;heterogeneous multi-radio environment;in-vehicle multimedia services;multi-radio access networks;network architecture;spectrum efficiency;traffic control;vehicular environments;wireless IP communication;Broadcast technology;Cellular networks;Digital video broadcasting;IP networks;Mobile communication;Multimedia communication;Radio broadcasting;Radio network;Vehicle dynamics;Web and internet services}, 
doi={10.1109/LCN.2000.891040}, 
ISSN={0742-1303},}



@MISC{FCC_spectrumEfficiency_2002,
note={FCC Spectrum Policy Task Force},
title = {Report of the Spectrum Efficiency Working Group},
howpublished = "\url{http://www.fcc.gov/sptf/reports.html}",
year = {2002},
}


@INPROCEEDINGS{dsa_model_markov_2006, 
author={Geirhofer, S. and Lang Tong and Sadler, B.M.}, 
booktitle={Proceedings of IEEE Military Communications Conference 2006}, 
title={A Measurement-Based Model for Dynamic Spectrum Access in {WLAN} Channels}, 
year={2006}, 
month={Oct}, 
pages={1-7}, 
keywords={Markov processes;time-domain analysis;wireless LAN;wireless channels;2.4 GHz;802.11b based wireless LAN;ISM band;Kolmogorov-Smirnov test;WLAN channels;continuous-time semiMarkov model;decision-theoretic framework;dynamic spectrum access;measurement-based model;optimal control;time-domain;vector signal analyzer;Interference;Military computing;Optimal control;Predictive models;Regulators;Signal analysis;Testing;Time domain analysis;Time sharing computer systems;Wireless LAN}, 
doi={10.1109/MILCOM.2006.302405},}



@INPROCEEDINGS{spectrumSharingGames_interference_stackelberg_2009, 
author={Bennis, M. and Le Treust, M. and Lasaulce, S. and Debbah, M. and Lilleberg, J.}, 
booktitle={Game Theory for Networks, 2009. GameNets '09. International Conference on}, 
title={Spectrum sharing games on the interference channel}, 
year={2009}, 
month={May}, 
pages={515-522}, 
keywords={channel allocation;decision theory;game theory;radiofrequency interference;wireless channels;Nash equilibrium;Stackelberg equilibrium;frequency band;interference channel;spectrum sharing game;strategic noncooperative game;wireless network;Base stations;Cognitive radio;Frequency;Game theory;Interference channels;Iterative algorithms;NIST;Nash equilibrium;Sufficient conditions;Wireless networks}, 
doi={10.1109/GAMENETS.2009.5137440},}


@article{spectrum_sharing_games_2010,
year={2010},
issn={0178-2770},
journal={Distributed Computing},
volume={22},
number={4},
doi={10.1007/s00446-010-0098-0},
title={On spectrum sharing games},
url={http://dx.doi.org/10.1007/s00446-010-0098-0},
publisher={Springer-Verlag},
keywords={Game theory; Nash equilibrium; Price of anarchy; Graph coloring; Approximation algorithm; Unit disk graph},
author={Halldórsson, MagnúsM. and Halpern, JosephY. and Li, LiErran and Mirrokni, VahabS.},
pages={235-248},
language={English}
}


@article{routing_CRN_challenges_solutions_2011,
title = "Routing in cognitive radio networks: challenges and solutions ",
journal = "Ad Hoc Networks ",
volume = "9",
number = "3",
pages = "228 - 248",
year = "2011",
note = "",
issn = "1570-8705",
//doi = "http://dx.doi.org/10.1016/j.adhoc.2010.06.009",
//url = "http://www.sciencedirect.com/science/article/pii/S157087051000079X",
author = "Matteo Cesana and Francesca Cuomo and Eylem Ekici",
keywords = "Cognitive radio networks",
keywords = "Routing protocols",
keywords = "Routing metrics",
keywords = "Cross-layering ",
abstract = "Cognitive radio networks (CRNs) are composed of cognitive, spectrum-agile devices capable of changing their configurations on the fly based on the spectral environment. This capability opens up the possibility of designing flexible and dynamic spectrum access strategies with the purpose of opportunistically reusing portions of the spectrum temporarily vacated by licensed primary users. On the other hand, the flexibility in the spectrum access phase comes with an increased complexity in the design of communication protocols at different layers. This work focuses on the problem of designing effective routing solutions for multi-hop CRNs, which is a focal issue to fully unleash the potentials of the cognitive networking paradigm. We provide an extensive overview of the research in the field of routing for CRNs, clearly differentiating two main categories: approaches based on a full spectrum knowledge, and approaches that consider only local spectrum knowledge obtained via distributed procedures and protocols. In each category we describe and comment on proposed design methodologies, routing metrics and practical implementation issues. Finally, possible future research directions are also proposed. "
}


@ARTICLE{cacao_ca_2011, 
author={Xiaonan Yue and Chi-Fai Wong and Chan, S.-H.G.}, 
journal={IEEE Transactions on Parallel and Distributed Systems, }, 
title={{CACAO}: Distributed Client-Assisted Channel Assignment Optimization for Uncoordinated {WLAN}s}, 
year={2011}, 
month={Sept}, 
volume={22}, 
number={9}, 
pages={1433-1440}, 
keywords={channel allocation;cochannel interference;computational complexity;interference suppression;telecommunication traffic;wireless LAN;IEEE 802.11;NP-hard;TCP throughputs;UDP throughputs;access points;channel selection;cochannel interference reduction;distributed client-assisted channel assignment optimization;feedback traffic information;network simulator 2;uncoordinated WLAN;Data models;Distributed algorithms;Interference;Network topology;Optimization;Throughput;Topology;Wireless;channel assignment;client-assisted;traffic aware.}, 
doi={10.1109/TPDS.2011.59}, 
ISSN={1045-9219},}


@ARTICLE{fuzzy_decision_09, 
author={Baldo, N. and Zorzi, M.}, 
journal={IEEE Transactions on Wireless Communications}, 
title={Cognitive network access using fuzzy decision making}, 
year={2009}, 
month={July}, 
volume={8}, 
number={7}, 
pages={3523-3535}, 
keywords={Internet;cognitive radio;decision making;fuzzy logic;optimisation;performance evaluation;quality of service;radio links;Internet;application-specific omniscient schemes;cognitive network access;core network performance;cross-layer communication quality metrics;fuzzy decision making;fuzzy logic;information sharing;performance evaluation;quality of service;radio link;transport-layer performance;wireless users;Cognition;Cognitive radio;Decision making;Fuzzy logic;Helium;IP networks;Quality of service;Radio communication;Radio link;Wireless networks;Access selection, cognitive radio networks, crosslayer optimization, fuzzy logic, fuzzy decision making, heterogeneous wireless networks.}, 
doi={10.1109/TWC.2009.071103}, 
ISSN={1536-1276},}

@ARTICLE{resourceAllocation_imperfectSensing_2012, 
author={Renchao Xie and Yu, F.R. and Hong Ji}, 
journal={IEEE Transactions on Vehicular Technology, }, 
title={Dynamic Resource Allocation for Heterogeneous Services in Cognitive Radio Networks With Imperfect Channel Sensing}, 
year={2012}, 
month={Feb}, 
volume={61}, 
number={2}, 
pages={770-780}, 
keywords={approximation theory;channel allocation;cognitive radio;computational complexity;integer programming;quality of service;resource allocation;stochastic programming;wireless channels;CRN;Lagrangian dual method;channel allocation problem;cognitive radio networks;computational complexity;discrete stochastic optimization method;dynamic radio environment;dynamic resource allocation;heterogeneous services;imperfect channel sensing;mixed-integer programming problem;optimal power allocation problem;secondary network;sensed radio environment;Base stations;Channel allocation;Channel estimation;Complexity theory;Joints;Resource management;Sensors;Cognitive radio;discrete stochastic optimization;heterogeneous services;imperfect channel sensing;mixed-integer programming}, 
doi={10.1109/TVT.2011.2181966}, 
ISSN={0018-9545},}

@INPROCEEDINGS{tvws_paper_networking2015, 
author={Elias, Jocelyne and Krunz, Marwan}, 
booktitle={Proc. of IFIP Networking Conference, 2015}, 
title={Distributed spectrum management in {TV} White Space Cognitive Radio Networks}, 
year={2015}, 
month={May}, 
pages={1-8}, 
keywords={Databases;Games;Interference;Linear programming;TV;White spaces;Database;Game theory;Guard bands;Nash equilibrium;Spectrum management;TV White Space;TV bands devices}, 
doi={10.1109/IFIPNetworking.2015.7145338},}

@book{Han:2008:RAW:1457343,
 author = {Han, Zhu and Liu, K. J. Ray},
 title = {Resource Allocation for Wireless Networks: Basics, Techniques, and Applications},
 year = {2008},
 isbn = {0521873851, 9780521873857},
 publisher = {Cambridge University Press},
 address = {New York, NY, USA},
}

@ARTICLE{Design_Mechanisms_1973,
title = {The Design of Mechanisms for Resource Allocation},
author = {Hurwicz, Leonid},
year = {1973},
journal = {American Economic Review},
volume = {63},
number = {2},
pages = {1-30},
//url = {http://EconPapers.repec.org/RePEc:aea:aecrev:v:63:y:1973:i:2:p:1-30}
}


@INPROCEEDINGS{kothari:congestion_serverMatching,
AUTHOR = "Anshul Kothari and Subhash Suri and Csaba D. Tóth and Yunhong Zhou",
TITLE = "Congestion Games, Load Balancing, and Price of Anarchy",
BOOKTITLE = "Proc. of CAAN'04",
//PAGES = {13-27},
//YEAR = {2004}, 
}

@book{Cloud_Computing_2010,
 author = {Chee, Brian J. S. and Franklin, Jr., Curtis},
 title = {Cloud Computing: Technologies and Strategies of the Ubiquitous Data Center},
 year = {2010},
 isbn = {1439806128, 9781439806128},
 edition = {1st},
 publisher = {CRC Press, Inc.},
 //address = {Boca Raton, FL, USA},
}

@ARTICLE{Ellingsaeter2012_Increasing_Available,
author={Bezabih, H. and Ellingsaeter, B. and Noll, J. and Maseng, T.},
journal={Vehicular Technology Magazine, IEEE},
title={Digital Broadcasting: Increasing the Available White Space Spectrum Using {TV} Receiver Information},
year={2012},
month={March},
volume={7},
number={1},
pages={24-30},
keywords={cognitive radio;television broadcasting;television receivers;TV receiver information;TV white spaces;cognitive radio;digital broadcasting;frequency 120 MHz;television receivers;white space spectrum;Broadcasting;Cognitive radio;Digital communication;Interference;Receivers;TV broadcasting;TV receivers;White spaces},
doi={10.1109/MVT.2011.2179344},
ISSN={1556-6072},}

@article{cr_sensor_2009,
 author = {Akan, Ozgur B. and Karli, Osman B. and Ergul, Ozgur},
 title = {Cognitive Radio Sensor Networks},
 journal = {Netwrk. Mag. of Global Internetwkg.},
 issue_date = {July/August 2009},
 volume = {23},
 number = {4},
 month = jul,
 year = {2009},
 issn = {0890-8044},
 pages = {34--40},
 numpages = {7},
 url = {http://dx.doi.org/10.1109/MNET.2009.5191144},
 doi = {10.1109/MNET.2009.5191144},
 acmid = {1670129},
 publisher = {IEEE Press},
 address = {Piscataway, NJ, USA},
}


@ARTICLE{congestion_control_wsn_2014,
author={Sergiou, C. and Antoniou, P. and Vassiliou, V.},
journal={Communications Surveys Tutorials, IEEE},
title={A Comprehensive Survey of Congestion Control Protocols in Wireless Sensor Networks},
year={2014},
month={Fourthquarter},
volume={16},
number={4},
pages={1839-1859},
keywords={ad hoc networks;protocols;telecommunication congestion control;wireless sensor networks;congestion avoidance;congestion control protocol;wireless ad hoc network;wireless sensor networks;Monitoring;Telecommunication congestion control;Telecommunication traffic;Throughput;Wireless communication;Wireless sensor networks;Wireless sensor networks (WSNs);congestion avoidance;congestion control;reliable transmission},
doi={10.1109/COMST.2014.2320071},
ISSN={1553-877X},}


@article{lindo,
 author = {Lin, Youdong and Schrage, Linus},
 title = {The Global Solver in the LINDO API},
 journal = {Optimization Methods Software},
 issue_date = {August 2009},
 volume = {24},
 number = {4-5},
 month = aug,
 year = {2009},
 issn = {1055-6788},
 pages = {657--668},
 numpages = {12},
 url = {http://dx.doi.org/10.1080/10556780902753221},
 doi = {10.1080/10556780902753221},
 acmid = {1597907},
 publisher = {Taylor \& Francis, Inc.},
 address = {Bristol, PA, USA},

}



@INPROCEEDINGS{clusterRoutingOverhead_wcnc04, 
author={Wu, H. and Abouzeid, A.A.}, 
booktitle={Proceedings of IEEE WCNC 2004}, 
title={Cluster-based routing overhead in networks with unreliable nodes}, 
year={2004}, 
month={march}, 
volume={4}, 
number={}, 
pages={ 2557 - 2562 Vol.4}, 
abstract={ While several cluster based routing algorithms have been proposed for ad hoc networks, there is a lack of formal mathematical analysis of these algorithms. Specifically, there is no published investigation of the relation between routing overhead on one hand and route request pattern (traffic) on the other. This paper provides a mathematical framework for quantifying the overhead of a cluster-based routing protocol. We explicitly model the application-level traffic in terms of the statistical description of the number of hops between a source and a destination. The network topology is modelled by a regular two-dimensional grid of unreliable nodes, and expressions for various components of the routing overhead are derived. The results show that clustering does not change the traffic requirement for infinite scalability compared to flat protocols, but reduces the overhead by a factor of O(1/M) where M is the cluster size. The analytic results are validated against simulations of random network topologies running a well known (D-hop max-min) clustering algorithm.}, 
keywords={ D-hop max-min clustering algorithm; ad hoc networks; application-level traffic; cluster-based routing protocol; mathematical framework; network topology; routing overhead; statistical description; two-dimensional grid; unreliable nodes; ad hoc networks; network topology; pattern clustering; routing protocols; statistical analysis; telecommunication network reliability; telecommunication traffic;}, 
doi={10.1109/WCNC.2004.1311491}, 
ISSN={1525-3511},}


@INPROCEEDINGS{clusterRoutingOverhead02infocom, 
author={Sucec, J. and Marsic, I.}, 
booktitle={Proc. of IEEE INFOCOM 2002}, 
title={Clustering overhead for hierarchical routing in mobile ad hoc networks}, 
year={2002},
month={}, 
volume={3}, 
number={}, 
pages={ 1698 - 1706 vol.3},
abstract={ Numerous clustering algorithms have been proposed that can support routing in mobile ad hoc networks (MANET). However, there is very little formal analysis that considers the communication overhead incurred by these procedures. Further, there is no published investigation of the overhead associated with the recursive application of clustering algorithms to support hierarchical routing. This paper provides a theoretical upper bound on the communication overhead incurred by a particular clustering algorithm for hierarchical routing in MANET. It is demonstrated that, given reasonable assumptions, the average clustering overhead generated per node per second is only polylogarithmic in the node count. To derive this result, novel techniques to assess cluster maintenance overhead are employed.}, 
keywords={ MANET; cluster maintenance overhead; communication overhead; hierarchical routing; mobile ad hoc networks; polylogarithmic node count; recursive application; upper bound; ad hoc networks; mobile computing; mobile radio; telecommunication network routing;}, 
doi={10.1109/INFCOM.2002.1019423}, 
ISSN={0743-166X },}

@INPROCEEDINGS{babadi_08, 
author={Babadi, B. and Tarokh, Vahid}, 
booktitle={In Proceedings of IEEE Sarnoff Symposium 2008}, 
title={Distributed Dynamic Frequency Allocation In Wireless Networks Under Time-Varying User Activities}, 
year={2008}, 
month={April}, 
pages={1-5}, 
keywords={Markov processes;frequency allocation;wireless channels;distributed dynamic frequency allocation;stochastic analysis;stochastic modeling;time-varying user activities;transmission frequency band;two-state Markov model;wireless networks;Algorithm design and analysis;Clustering algorithms;Convergence;Frequency;Heuristic algorithms;Interference;Performance analysis;Radio spectrum management;Stochastic processes;Wireless networks}, 
doi={10.1109/SARNOF.2008.4520043},}

@INPROCEEDINGS{aggregate_interference_shadow_fading_2010, 
author={Ruttik, K. and Koufos, K. and Jantti, R.}, 
booktitle={In Proceedings of IEEE PIMRC 2011}, 
title={Model for computing aggregate interference from secondary cellular network in presence of correlated shadow fading}, 
year={2011}, 
pages={433-437}, 
keywords={cellular radio;fading;radio receivers;radiofrequency interference;aggregate interference;cellular system downlink;correlated shadow fading;interference level estimation;power spatial density;primary receivers;secondary cellular network;secondary transmitters;Aggregates;Computational modeling;Correlation;Fading;Interference;Shadow mapping;Signal to noise ratio;Aggregate interference;Cognitive radio}, 
doi={10.1109/PIMRC.2011.6139998}, 
ISSN={pending}, 
month={Sept},}


@ARTICLE{tvspectrum_trading_2012, 
author={Bogucka, H. and Parzy, M. and Marques, P. and Mwangoka, J.W. and Forde, T.}, 
journal={IEEE Communications Magazine}, 
title={Secondary spectrum trading in TV white spaces}, 
year={2012}, 
volume={50}, 
number={11}, 
pages={121-129}, 
keywords={contracts;digital television;frequency allocation;interference (signal);transmitters;DTV transmission systems;TV white spaces;TVWS secondary spectrum market;auction design;auction modes;high power network geometries;high tower;interference;multifrequency systems;secondary spectrum trading;spectrum broker;spectrum frequency bands;spectrum trading mechanisms;spectrum-leasing contracts;transmitters;Benchmark testing;Databases;Digital TV;Licenses;Radio spectrum management;Resource management;White spaces}, 
doi={10.1109/MCOM.2012.6353691}, 
ISSN={0163-6804}, 
month={November},}

@ARTICLE{hybridPricing_tvspace_2014, 
author={Xiaojun Feng and Qian Zhang and Jin Zhang}, 
journal={IEEE Transactions on Wireless Communications}, 
title={A Hybrid Pricing Framework for TV White Space Database}, 
year={2014}, 
volume={13}, 
number={5}, 
pages={2626-2635}, 
keywords={distributed algorithms;game theory;pricing;telecommunication channels;telecommunication industry;telecommunication network management;telecommunication network planning;television equipment;FCC;Federal Communications Commission;NE;Nash equilibrium;SU;TV bandwidth;TV channel;TV white space database;TVWS;WSD;bandwidth reservation;distributed algorithm;geolocation database;hybrid pricing framework;noncooperative game;registration scheme;secondary user;service plan scheme;white space device;Bandwidth;Contracts;Cost accounting;Databases;Games;Pricing;TV;TV white space;contract theory;game theory;geo-location database;pricing}, 
doi={10.1109/TWC.2014.031914.130130}, 
ISSN={1536-1276}, 
month={May},}

@INPROCEEDINGS{utility_max_tvspace_2014, 
author={Liang Zheng and Chee Wei Tan}, 
booktitle={In Proceedings of 2014 IEEE Conference on Computer Communications Workshops (within INFOCOM)}, 
title={Smart spectrum access algorithms in mobile TV white space networks for utility maximization}, 
year={2014}, 
pages={175-176}, 
keywords={cognitive radio;mobile radio;optimisation;quality of experience;radio broadcasting;radio networks;radio spectrum management;radiofrequency interference;resource allocation;television broadcasting;television interference;television networks;FCC;Federal Communication Commission;broadcast TV Whitespace;consumer device;frequency 500 MHz;interference;mobile TV white space network;mobile computing service;opportunistic unlicensed secondary user;quality of experience;resource allocation;smart spectrum access algorithm;utility maximization;wireless cognitive radio network;Cognitive radio;Interference;Mobile TV;Signal to noise ratio;Student activities;White spaces}, 
doi={10.1109/INFCOMW.2014.6849212}, 
month={April},}


@INPROCEEDINGS{spectrum_sharing_tvspace_2012, 
author={Chen, Xu and Jianwei Huang}, 
booktitle={In Proceedings of 2012 IEEE 32nd International Conference on Distributed Computing Systems (ICDCS)}, 
title={Game Theoretic Analysis of Distributed Spectrum Sharing with Database}, 
year={2012}, 
pages={255-264}, 
keywords={Algorithm design and analysis;Databases;Games;Heuristic algorithms;Manganese;Nash equilibrium;TV;database;distributed spectrum sharing;game theory;white space}, 
doi={10.1109/ICDCS.2012.37}, 
ISSN={1063-6927}, 
month={June},
%note= game and utility
}

@INPROCEEDINGS{maximum_power_TVWS_dyspan_2011, 
author={Karimi, H.R.}, 
booktitle={New Frontiers in Dynamic Spectrum Access Networks (DySPAN), 2011 IEEE Symposium on}, 
title={Geolocation databases for white space devices in the UHF TV bands: Specification of maximum permitted emission levels}, 
year={2011}, 
pages={443-454}, 
keywords={UHF radio propagation;digital television;probability;radiofrequency interference;DTT band;DTT service location probability;UHF TV band;WSD regulatory emission limit;digital terrestrial TV;geolocation database;maximum permitted emission level;multiple DTT channel;national DTT network planning model;white space device;Databases;Equations;Geology;Interference;Mathematical model;Pixel;Receivers;White space devices;cognitive radios;geolocation database;interference;regulation;spectrum management}, 
doi={10.1109/DYSPAN.2011.5936234}, 
month={May},}

@inproceedings{Gu_distributed_rendezvous_2014,
 author = {Gu, Zhaoquan and Hua, Qiang-Sheng and Dai, Weiguo},
 title = {Fully Distributed Algorithms for Blind Rendezvous in Cognitive Radio Networks},
 booktitle = {Proceedings of the 2014 ACM MobiHoc},
 series = {MobiHoc '14},
 keywords = {blind rendezvous, cognitive radio networks, distributed algorithm},
}

@ARTICLE{ca_crn_survey_2013,
author={Tragos, E.Z. and Zeadally, S. and Fragkiadakis, A.G. and Siris, V.A.},
journal={Communications Surveys Tutorials, IEEE},
title={Spectrum Assignment in Cognitive Radio Networks: A Comprehensive Survey},
year={2013},
volume={15},
number={3},
pages={1108-1135},
keywords={cognitive radio;interference suppression;radio spectrum management;CR devices;cognitive radio networks;governmental agencies;interference limitation;spectrum assignment;spectrum holes;white spaces;wireless networks;Bandwidth;Cognitive radio;Interference;Sensors;Standards;Wireless networks;channel assignment;cognitive radio networks;dynamic spectrum management;spectrum allocation;spectrum assignment;spectrum selection},
doi={10.1109/SURV.2012.121112.00047},
ISSN={1553-877X},
month={Third},}

@ARTICLE{pa_crn_survey_2012,
author={Sorooshyari, S. and Chee Wei Tan and Mung Chiang},
journal={Networking, IEEE/ACM Transactions on},
title={Power Control for Cognitive Radio Networks: Axioms, Algorithms, and Analysis},
year={2012},
volume={20},
number={3},
pages={878-891},
keywords={cognitive radio;power control;quality of service;radiofrequency interference;telecommunication control;telecommunication network management;DPCPC policies;QoS protection;axiomatic framework;cognitive radio networks;duo priority class power control;efficient spectrum sharing;interference management;interference-aware power-control algorithm;opportunistic spectrum access;power allocation;quality of service;wireless networks;Cognitive radio;Convergence;Interference;Power control;Quality of service;Receivers;Resource management;Cognitive radio;distributed algorithms;dynamic spectrum access;power control},
doi={10.1109/TNET.2011.2169986},
ISSN={1063-6692},
month={June},}

@ARTICLE{resource_allocation_crn_Ahmad_2015,
author={Ahmad, A. and Ahmad, S. and Rehmani, M.H. and Hassan, N.U.},
journal={Communications Surveys Tutorials, IEEE},
title={A Survey on Radio Resource Allocation in Cognitive Radio Sensor Networks},
year={2015},
volume={17},
number={2},
pages={888-917},
keywords={cognitive radio;energy conservation;radiofrequency interference;resource allocation;wireless sensor networks;ISM band;QoS assurance;WSN;cognitive radio sensor networks;energy efficiency;hand-off reduction;interference avoidance;internetwork interferences;internode interferences;network lifetime;radio resource allocation;throughput maximization;unlicensed industrial, scientific, and medical band;wireless sensor networks;Cognitive radio;Dynamic scheduling;Interference;Resource management;Wireless networks;Wireless sensor networks;Cognitive radio sensor network;cognitive radio networks;radio resource allocation;wireless sensor networks},
doi={10.1109/COMST.2015.2401597},
ISSN={1553-877X},
month={Secondquarter},}

@article{powercontrol_chinag,
 author = {Chiang, Mung and Hande, Prashanth and Lan, Tian and Tan, Chee Wei},
 title = {Power Control in Wireless Cellular Networks},
 journal = {Found. Trends Netw.},
 issue_date = {April 2008},
 volume = {2},
 number = {4},
 month = apr,
 year = {2008},
 issn = {1554-057X},
 pages = {381--533},
 numpages = {153},
 url = {http://dx.doi.org/10.1561/1300000009},
 doi = {10.1561/1300000009},
 acmid = {1454706},
 publisher = {Now Publishers Inc.},
 address = {Hanover, MA, USA},
}

@INPROCEEDINGS{localBargaining_05,
author={Lili Cao and Haitao Zheng},
booktitle={Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005. 2005 Second Annual IEEE Communications Society Conference on},
title={Distributed spectrum allocation via local bargaining},
year={2005},
pages={475-486},
keywords={Ad hoc networks;Asia;Computer networks;Control systems;Distributed computing;Feeds;Interference elimination;Mobile communication;Network topology;Stress},
doi={10.1109/SAHCN.2005.1557100},
month={Sept},}

@INPROCEEDINGS{reinforcement_learning_crn_wcnc_2013,
author={Faganello, L.R. and Kunst, R. and Both, C.B. and Granville, L.Z. and Rochol, J.},
booktitle={Wireless Communications and Networking Conference (WCNC), 2013 IEEE},
title={Improving reinforcement learning algorithms for dynamic spectrum allocation in cognitive sensor networks},
year={2013},
pages={35-40},
keywords={channel allocation;cognitive radio;learning (artificial intelligence);radio networks;radio spectrum management;telecommunication computing;Q-Learning;channel allocation;channel propagation condition;cognitive radio networks;cognitive sensor networks;dynamic spectrum allocation algorithm;reinforcement learning algorithm;spectrum access;Heuristic algorithms;Interference;Mathematical model;Resource management;Signal to noise ratio;Wireless communication;Wireless sensor networks},
doi={10.1109/WCNC.2013.6554535},
ISSN={1525-3511},
month={April},}

@ARTICLE{reinforcement_learning_crn_2011,
author={Jiang, T. and Grace, D. and Mitchell, P.D.},
journal={Communications, IET},
title={Efficient exploration in reinforcement learning-based cognitive radio spectrum sharing},
year={2011},
volume={5},
number={10},
pages={1309-1317},
keywords={cognitive radio;learning (artificial intelligence);cognitive radio spectrum;dynamic radio environment;reinforcement learning},
doi={10.1049/iet-com.2010.0258},
ISSN={1751-8628},
month={July},}

@TECHREPORT{Cisco_report_2015,
  AUTHOR =        {Cisco},
  TITLE =         {Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update 2014–2019 White Paper},
  NOTE =          {},
  MONTH =         {February},
  YEAR  =         {2015},
  FILE  =         {http://www.cisco.com/c/en/us/solutions/collateral/service-provider/visual-networking-index-vni/white_paper_c11-520862.pdf},
  URL   =         {http://www.cisco.com/c/en/us/solutions/collateral/service-provider/visual-networking-index-vni/white_paper_c11-520862.html},
}

@ARTICLE{crn_futurecellular_2014,
author={Shao-Yu Lien and Kwang-Cheng Chen and Ying-Chang Liang and Yonghua Lin},
journal={Wireless Communications, IEEE},
title={Cognitive radio resource management for future cellular networks},
year={2014},
volume={21},
number={1},
pages={70-79},
keywords={4G mobile communication;Long Term Evolution;cognitive radio;quality of service;radio spectrum management;resource allocation;software radio;5G cellular network;LTE A cellular networks;LTE B cellular networks;Layer 1 radio operations;Layer 2 radio operations;cognitive radio resource management;device to device communications;heterogeneous network architecture;optimum control;quality of service guarantees;resource allocation;software defined design;transmission reliability;wireless systems;Cognitive radio;Compressed sensing;IEEE 802.11 Standards;Interference;Macrocell networks;Resource management},
doi={10.1109/MWC.2014.6757899},
ISSN={1536-1284},
month={February},}

@ARTICLE{joint_power_channel_centralized_2015,
author={Monemi, M. and Rasti, M. and Hossain, E.},
journal={Wireless Communications, IEEE Transactions on},
title={On Joint Power and Admission Control in Underlay Cellular Cognitive Radio Networks},
year={2015},
volume={14},
number={1},
pages={265-278},
keywords={cellular radio;cognitive radio;power control;quality of service;radiofrequency interference;telecommunication congestion control;CRN;PRN;QoS;SINR vector;joint power-admission control;low-complexity centralized algorithms;max-min quality-of-service;power vector;primary radio network;primary users;secondary user outage ratio;secondary users;signal-to-interference-plus-noise ratio;spectrum underlay fashion;underlay cellular cognitive radio networks;Admission control;Base stations;Complexity theory;Interference;Signal to noise ratio;Vectors;Cognitive radio network;SINR assignment;power and admission control;underlay channel access},
doi={10.1109/TWC.2014.2340866},
ISSN={1536-1276},
month={Jan},}


@article{Atomic_Congestion_Games_2010,
year={2010},
issn={1432-4350},
journal={Theory of Computing Systems},
volume={47},
number={1},
doi={10.1007/s00224-009-9198-2},
title={Atomic Congestion Games: Fast, Myopic and Concurrent},
url={http://dx.doi.org/10.1007/s00224-009-9198-2},
publisher={Springer-Verlag},
keywords={Distributed congestion games; Atomic model; Approximate Nash Equilibria},
author={Fotakis, D. and Kaporis, A.C. and Spirakis, P.G.},
pages={38-59},
language={English}
}

@inproceedings{aaai_IeongMNSS05,
    author = {Samuel Ieong and Robert Mcgrew and Eugene Nudelman and Yoav Shoham and Qixiang Sun},
    title = {Fast and Compact: A Simple Class of Congestion Games},
    booktitle = {Proc. of the 20th Nat. Conference on Artificial Intelligence (AAAI},
    year = {2005},
    pages = {489--494}
}

@article{Mondere_potential_game:1996,
  added-at = {2009-11-23T13:25:47.000+0100},
  author = {Monderer, D and Shapley, LS},
  biburl = {http://www.bibsonomy.org/bibtex/2400b791733cc1199ee3121ae019c8bf0/achimpassen},
  date-added = {2009-05-03 18:53:55 +0200},
  date-modified = {2009-06-03 13:52:07 +0200},
  interhash = {3b8a42a933c2b011741ccb310f24a8b7},
  intrahash = {400b791733cc1199ee3121ae019c8bf0},
  journal = {Games and Economic Behavior},
  keywords = {imported},
  local-url = {file://localhost/Users/achim/Documents/Papers/1996/Monderer/Games%20and%20Economic%20Behavior%201996%20Potential%20games.pdf},
  number = 1,
  pages = {124--143},
  pmid = {14213258581360167816related:iMu-6l-jP8UJ},
  rating = {0},
  timestamp = {2009-11-23T13:25:49.000+0100},
  title = {Potential games},
  uri = {papers://C3D2787C-59DE-4F5F-B604-503052CE153D/Paper/p121},
  volume = 14,
  year = 1996
}


@inproceedings{FKKMS02,
  title = "The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.",
  author = "D. Fotakis and S. Kontogiannis and E. Koutsoupias and M. Mavronicolas and P. Spirakis",
  year = "2002",
  address = "Malaga, Spain",
  booktitle = "Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP)",
  pages = "123--134",
}

@INPROCEEDINGS{clustering_mesh_globecom2010, 
author={M. Krebs and A. Stein and M. A. Lora}, 
booktitle={IEEE GLOBECOM 2010}, 
title={Topology Stability-Based Clustering for Wireless Mesh Networks}, 
keywords={mobile ad hoc networks;pattern clustering;telecommunication network topology;wireless mesh networks;MANET;link instability;link losses;mobile ad hoc networks;mobile nodes;stable link clustering algorithm;static backbone;topology stability-based clustering;wireless mesh networks;Ad hoc networks;Clustering algorithms;Peer to peer computing;Stability analysis;Topology;Wireless communication;Wireless mesh networks}, 
doi={10.1109/GLOCOM.2010.5683417}, 
ISSN={1930-529X}, 
}